WordGPT

The number 40791

40791 is a composite number with 4 divisors. Its prime factorisation is 3 × 13597. Divisors (4): 1, 3, 13597, 40791.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 40791: a semiprime: 3 × 13597, the product of two primes.

  2. 2

    40791 is composite. Its prime factorisation is

    40791=3×1359740791 = 3 \times 13597
  3. 3

    The divisors add up to 54392; without 40791 itself that is 13601, so 40791 is deficient (13601 is less than 40791). Euler's totient φ(40791) = 27192 numbers up to 40791 share no factor with it.

  4. 4

    The digits of 40791 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.

LaTeX source of the formulas on this page
\[ 40791 = 3 \times 13597 \]

40791 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors54392
Euler totient φ(n)27192
Square1663905681
Cube67872376633671
Square root201.967819
Digit sum / digital root21 / 3
Collatz steps to 188
Scientific notation4.0791 × 10410^{4}

40791 in other forms

FormValue
In wordsforty thousand seven hundred and ninety-one
Binary (base 2)1001111101010111
Octal (base 8)117527
Hexadecimal (base 16)9F57
Base 32001221210
As time40791 seconds = 11 h 19 min 51 s

Is 40791 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3Yes (40791 ÷ 3 = 13597)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 3)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 2)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 7)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 3)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 3)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 3)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 40791 a prime number?

No. 40791 = 3 × 13597, so it is divisible by 3.

What are the factors of 40791?

1, 3, 13597, 40791.

What is 40791 in binary?

1001111101010111 (hexadecimal 9F57, octal 117527).

What is the square root of 40791?

About 201.9678.

Is 40791 divisible by 3?

Yes. Its digits add up to 21, a multiple of 3.

What is special about the number 40791?

40791 is a semiprime: 3 × 13597, the product of two primes.

Find the next one

Nearby numbers

    40791: is it prime? Factors, square root, binary, Roman numeral | WordGPT