Base | Representation |
---|---|
bin | 110000011011100100… |
… | …0101010111100011001 |
3 | 100221110020022120001221 |
4 | 1200313020222330121 |
5 | 3201000041010113 |
6 | 115440123412041 |
7 | 10341215261056 |
oct | 1406710527431 |
9 | 327406276057 |
10 | 104004235033 |
11 | 40120752156 |
12 | 181a6984021 |
13 | 9a6628499a |
14 | 5068b9802d |
15 | 2a8aa4998d |
hex | 183722af19 |
104004235033 has 8 divisors (see below), whose sum is σ = 109788285600. Its totient is φ = 98251198848.
The previous prime is 104004234979. The next prime is 104004235039. The reversal of 104004235033 is 330532400401.
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 104004235033 - 221 = 104002137881 is a prime.
It is a super-2 number, since 2×1040042350332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104004234989 and 104004235007.
It is not an unprimeable number, because it can be changed into a prime (104004235039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7746703 + ... + 7760116.
It is an arithmetic number, because the mean of its divisors is an integer number (13723535700).
Almost surely, 2104004235033 is an apocalyptic number.
It is an amenable number.
104004235033 is a deficient number, since it is larger than the sum of its proper divisors (5784050567).
104004235033 is a wasteful number, since it uses less digits than its factorization.
104004235033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15507191.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 104004235033 its reverse (330532400401), we get a palindrome (434536635434).
The spelling of 104004235033 in words is "one hundred four billion, four million, two hundred thirty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •