Base | Representation |
---|---|
bin | 110000011011100010… |
… | …1100110101001111001 |
3 | 100221110011210201012011 |
4 | 1200313011212221321 |
5 | 3200444334243113 |
6 | 115440054245521 |
7 | 10341205402045 |
oct | 1406705465171 |
9 | 327404721164 |
10 | 104003431033 |
11 | 40120253097 |
12 | 181a66568a1 |
13 | 9a66062a48 |
14 | 5068a29025 |
15 | 2a8a93b63d |
hex | 1837166a79 |
104003431033 has 8 divisors (see below), whose sum is σ = 105865644800. Its totient is φ = 102154860288.
The previous prime is 104003431031. The next prime is 104003431043. The reversal of 104003431033 is 330134300401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104003431033 - 21 = 104003431031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104003430995 and 104003431013.
It is not an unprimeable number, because it can be changed into a prime (104003431031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3395373 + ... + 3425866.
It is an arithmetic number, because the mean of its divisors is an integer number (13233205600).
Almost surely, 2104003431033 is an apocalyptic number.
It is an amenable number.
104003431033 is a deficient number, since it is larger than the sum of its proper divisors (1862213767).
104003431033 is an equidigital number, since it uses as much as digits as its factorization.
104003431033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6821511.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 104003431033 its reverse (330134300401), we get a palindrome (434137731434).
The spelling of 104003431033 in words is "one hundred four billion, three million, four hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •