Base | Representation |
---|---|
bin | 101111101111111010110001… |
… | …000101100111101011101000 |
3 | 1000112112220112212111021110011 |
4 | 233233322301011213223220 |
5 | 210011124224103323422 |
6 | 2022345101402301304 |
7 | 62143036034632366 |
oct | 5757726105475350 |
9 | 1015486485437404 |
10 | 210001102011112 |
11 | 60a04a70405655 |
12 | 1b6777541b7834 |
13 | 9024032820589 |
14 | 39c0171256636 |
15 | 1942925b14077 |
hex | befeb1167ae8 |
210001102011112 has 128 divisors (see below), whose sum is σ = 424772284809600. Its totient is φ = 97136486092800.
The previous prime is 210001102011011. The next prime is 210001102011131. The reversal of 210001102011112 is 211110201100012.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 210001102011092 and 210001102011101.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 210449868 + ... + 211445380.
It is an arithmetic number, because the mean of its divisors is an integer number (3318533475075).
Almost surely, 2210001102011112 is an apocalyptic number.
It is an amenable number.
210001102011112 is an abundant number, since it is smaller than the sum of its proper divisors (214771182798488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210001102011112 is a wasteful number, since it uses less digits than its factorization.
210001102011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 995987 (or 995983 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 210001102011112 its reverse (211110201100012), we get a palindrome (421111303111124).
The spelling of 210001102011112 in words is "two hundred ten trillion, one billion, one hundred two million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •