WordGPT

The number 46803

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

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

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

  2. 2

    46803 is composite. Its prime factorisation is

    46803=3×1560146803 = 3 \times 15601
  3. 3

    The divisors add up to 62408; without 46803 itself that is 15605, so 46803 is deficient (15605 is less than 46803). Euler's totient φ(46803) = 31200 numbers up to 46803 share no factor with it.

  4. 4

    The digits of 46803 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 145 steps to reach 1.

LaTeX source of the formulas on this page
\[ 46803 = 3 \times 15601 \]

46803 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors62408
Euler totient φ(n)31200
Square2190520809
Cube102522945423627
Square root216.340010
Digit sum / digital root21 / 3
Collatz steps to 1145
Scientific notation4.6803 × 10410^{4}

46803 in other forms

FormValue
In wordsforty-six thousand eight hundred and three
Binary (base 2)1011011011010011
Octal (base 8)133323
Hexadecimal (base 16)B6D3
Base 32101012110
As time46803 seconds = 13 h 0 min 3 s

Is 46803 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 (46803 ÷ 3 = 15601)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 3)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 1)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 3)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 3)A number is divisible by 10 if the last digit is 0.
11No (remainder 9)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 46803 a prime number?

No. 46803 = 3 × 15601, so it is divisible by 3.

What are the factors of 46803?

1, 3, 15601, 46803.

What is 46803 in binary?

1011011011010011 (hexadecimal B6D3, octal 133323).

What is the square root of 46803?

About 216.3400.

Is 46803 divisible by 3?

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

What is special about the number 46803?

46803 is a semiprime: 3 × 15601, the product of two primes.

Find the next one

Nearby numbers

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