Base | Representation |
---|---|
bin | 11110100100101110000… |
… | …100110001101111101011 |
3 | 21102212002010202201201010 |
4 | 132210232010301233223 |
5 | 233410333033341021 |
6 | 4245105214555003 |
7 | 304536015303633 |
oct | 36445604615753 |
9 | 7385063681633 |
10 | 2101012012011 |
11 | 740041564550 |
12 | 29b234808a63 |
13 | 123180928593 |
14 | 739920a76c3 |
15 | 399baebc976 |
hex | 1e92e131beb |
2101012012011 has 16 divisors (see below), whose sum is σ = 3235783206528. Its totient is φ = 1198438224000.
The previous prime is 2101012012007. The next prime is 2101012012019. The reversal of 2101012012011 is 1102102101012.
It is not a de Polignac number, because 2101012012011 - 22 = 2101012012007 is a prime.
It is a super-2 number, since 2×21010120120112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2101012012019) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1872559165 + ... + 1872560286.
It is an arithmetic number, because the mean of its divisors is an integer number (202236450408).
Almost surely, 22101012012011 is an apocalyptic number.
2101012012011 is a deficient number, since it is larger than the sum of its proper divisors (1134771194517).
2101012012011 is a wasteful number, since it uses less digits than its factorization.
2101012012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3745119482.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2101012012011 its reverse (1102102101012), we get a palindrome (3203114113023).
It can be divided in two parts, 21010 and 12012011, that added together give a palindrome (12033021).
The spelling of 2101012012011 in words is "two trillion, one hundred one billion, twelve million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •