Base | Representation |
---|---|
bin | 11110101110001101111… |
… | …110110111111110101100 |
3 | 21110211101220222121111220 |
4 | 132232031332313332230 |
5 | 234042230004341022 |
6 | 4253513230543340 |
7 | 305346530336544 |
oct | 36561576677654 |
9 | 7424356877456 |
10 | 2111211012012 |
11 | 7443a5639173 |
12 | 2a1200367b50 |
13 | 12411790cb1b |
14 | 7427c82c324 |
15 | 39db658885c |
hex | 1eb8dfb7fac |
2111211012012 has 48 divisors (see below), whose sum is σ = 4969086001152. Its totient is φ = 697613817600.
The previous prime is 2111211011983. The next prime is 2111211012017. The reversal of 2111211012012 is 2102101121112.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2111211011982 and 2111211012000.
It is not an unprimeable number, because it can be changed into a prime (2111211012017) 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 15 ways as a sum of consecutive naturals, for example, 1253593 + ... + 2407055.
It is an arithmetic number, because the mean of its divisors is an integer number (103522625024).
Almost surely, 22111211012012 is an apocalyptic number.
It is an amenable number.
2111211012012 is an abundant number, since it is smaller than the sum of its proper divisors (2857874989140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111211012012 is a wasteful number, since it uses less digits than its factorization.
2111211012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154798 (or 1154796 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2111211012012 its reverse (2102101121112), we get a palindrome (4213312133124).
The spelling of 2111211012012 in words is "two trillion, one hundred eleven billion, two hundred eleven million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •