Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001011111000101011110101 |
3 | 112102110222211120221000021100 |
4 | 121000232123023320223311 |
5 | 103404224032304031401 |
6 | 1025541433345040313 |
7 | 32112211412062542 |
oct | 3100563313705365 |
9 | 472428746830240 |
10 | 110001011002101 |
11 | 32060191a9901a |
12 | 10406b24026099 |
13 | 494c08789135b |
14 | 1d24112313bc9 |
15 | cab5a3368b86 |
hex | 640b9b2f8af5 |
110001011002101 has 24 divisors (see below), whose sum is σ = 159060963540960. Its totient is φ = 73255265034336.
The previous prime is 110001011002097. The next prime is 110001011002139. The reversal of 110001011002101 is 101200110100011.
It is not a de Polignac number, because 110001011002101 - 22 = 110001011002097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110001018002101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 833849935 + ... + 833981843.
It is an arithmetic number, because the mean of its divisors is an integer number (6627540147540).
Almost surely, 2110001011002101 is an apocalyptic number.
It is an amenable number.
110001011002101 is a deficient number, since it is larger than the sum of its proper divisors (49059952538859).
110001011002101 is a wasteful number, since it uses less digits than its factorization.
110001011002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230705 (or 230702 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110001011002101 its reverse (101200110100011), we get a palindrome (211201121102112).
The spelling of 110001011002101 in words is "one hundred ten trillion, one billion, eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •