Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …101101111001100100010010 |
3 | 112102212112000201101201102210 |
4 | 121002110331231321210102 |
5 | 103413030024133310002 |
6 | 1030104202503452550 |
7 | 32123160001153635 |
oct | 3102247555714422 |
9 | 472775021351383 |
10 | 110111112010002 |
11 | 320a2951158934 |
12 | 10424330757156 |
13 | 4959582c9573c |
14 | 1d29598aabc1c |
15 | cae39926496c |
hex | 64253db79912 |
110111112010002 has 64 divisors (see below), whose sum is σ = 223080699138048. Its totient is φ = 36229542360000.
The previous prime is 110111112009971. The next prime is 110111112010019. The reversal of 110111112010002 is 200010211111011.
It is a self number, because there is not a number n which added to its sum of digits gives 110111112010002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1364900127 + ... + 1364980797.
It is an arithmetic number, because the mean of its divisors is an integer number (3485635924032).
Almost surely, 2110111112010002 is an apocalyptic number.
110111112010002 is an abundant number, since it is smaller than the sum of its proper divisors (112969587128046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110111112010002 is a wasteful number, since it uses less digits than its factorization.
110111112010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87615.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110111112010002 its reverse (200010211111011), we get a palindrome (310121323121013).
The spelling of 110111112010002 in words is "one hundred ten trillion, one hundred eleven billion, one hundred twelve million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •