Base | Representation |
---|---|
bin | 10011101010011000… |
… | …101100011010101000 |
3 | 2000111100100110001220 |
4 | 103222120230122220 |
5 | 321214211223422 |
6 | 13410535542040 |
7 | 1345115555616 |
oct | 235230543250 |
9 | 60440313056 |
10 | 21112211112 |
11 | 8a54324763 |
12 | 411252a920 |
13 | 1cb5c42715 |
14 | 1043cc26b6 |
15 | 838714e5c |
hex | 4ea62c6a8 |
21112211112 has 16 divisors (see below), whose sum is σ = 52780527840. Its totient is φ = 7037403696.
The previous prime is 21112211059. The next prime is 21112211119. The reversal of 21112211112 is 21111221112.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 21112211091 and 21112211100.
It is not an unprimeable number, because it can be changed into a prime (21112211119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 439837708 + ... + 439837755.
It is an arithmetic number, because the mean of its divisors is an integer number (3298782990).
Almost surely, 221112211112 is an apocalyptic number.
It is an amenable number.
21112211112 is an abundant number, since it is smaller than the sum of its proper divisors (31668316728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112211112 is a wasteful number, since it uses less digits than its factorization.
21112211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 879675472 (or 879675468 counting only the distinct ones).
The product of its digits is 16, while the sum is 15.
Adding to 21112211112 its reverse (21111221112), we get a palindrome (42223432224).
It can be divided in two parts, 21112 and 211112, that multiplied together give a palindrome (4456996544).
The spelling of 21112211112 in words is "twenty-one billion, one hundred twelve million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •