Base | Representation |
---|---|
bin | 10111101010111000111011… |
… | …110001110011011101001011 |
3 | 111122121002112122202002122012 |
4 | 113222320323301303131023 |
5 | 102121103224034411021 |
6 | 1005223554105450135 |
7 | 30633103006564025 |
oct | 2752707361633513 |
9 | 448532478662565 |
10 | 104102420232011 |
11 | 30196652304a93 |
12 | b8138b5aa094b |
13 | 4611a7bca1956 |
14 | 1b9c8267bb015 |
15 | c07e221d535b |
hex | 5eae3bc7374b |
104102420232011 has 8 divisors (see below), whose sum is σ = 104170052656800. Its totient is φ = 104034788909440.
The previous prime is 104102420231951. The next prime is 104102420232029. The reversal of 104102420232011 is 110232024201401.
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 104102420232011 - 26 = 104102420231947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104102420232091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 282557705 + ... + 282925893.
It is an arithmetic number, because the mean of its divisors is an integer number (13021256582100).
Almost surely, 2104102420232011 is an apocalyptic number.
104102420232011 is a deficient number, since it is larger than the sum of its proper divisors (67632424789).
104102420232011 is a wasteful number, since it uses less digits than its factorization.
104102420232011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551109.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 104102420232011 its reverse (110232024201401), we get a palindrome (214334444433412).
The spelling of 104102420232011 in words is "one hundred four trillion, one hundred two billion, four hundred twenty million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •