WordGPT

The number 46801

46801 is a composite number with 4 divisors. Its prime factorisation is 17 × 2753. Divisors (4): 1, 17, 2753, 46801.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 46801: a semiprime: 17 × 2753, the product of two primes.

  2. 2

    46801 is composite. Its prime factorisation is

    46801=17×275346801 = 17 \times 2753
  3. 3

    The divisors add up to 49572; without 46801 itself that is 2771, so 46801 is deficient (2771 is less than 46801). Euler's totient φ(46801) = 44032 numbers up to 46801 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 46801 = 17 \times 2753 \]

46801 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors49572
Euler totient φ(n)44032
Square2190333601
Cube102509802860401
Square root216.335388
Digit sum / digital root19 / 1
Collatz steps to 1145
Scientific notation4.6801 × 10410^{4}

46801 in other forms

FormValue
In wordsforty-six thousand eight hundred and one
Binary (base 2)1011011011010001
Octal (base 8)133321
Hexadecimal (base 16)B6D1
Base 32101012101
As time46801 seconds = 13 h 0 min 1 s

Is 46801 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).
3No (remainder 1)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 1)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 1)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 6)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 1)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 1)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 7)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 1)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 46801 a prime number?

No. 46801 = 17 × 2753, so it is divisible by 17.

What are the factors of 46801?

1, 17, 2753, 46801.

What is 46801 in binary?

1011011011010001 (hexadecimal B6D1, octal 133321).

What is the square root of 46801?

About 216.3354.

Is 46801 divisible by 3?

No. Its digits add up to 19, which is not a multiple of 3.

What is special about the number 46801?

46801 is a semiprime: 17 × 2753, the product of two primes.

Find the next one

Nearby numbers

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