Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …011100100110011110010 |
3 | 21102212001101102222200012 |
4 | 132210231123210303302 |
5 | 233410322302223442 |
6 | 4245104151254522 |
7 | 304535524430312 |
oct | 36445533446362 |
9 | 7385041388605 |
10 | 2101001211122 |
11 | 7400364576a0 |
12 | 29b23107a442 |
13 | 12317b616318 |
14 | 73990895442 |
15 | 399ba087582 |
hex | 1e92d6e4cf2 |
2101001211122 has 8 divisors (see below), whose sum is σ = 3438001981872. Its totient is φ = 955000550500.
The previous prime is 2101001211103. The next prime is 2101001211149. The reversal of 2101001211122 is 2211121001012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×21010012111222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2101001211097 and 2101001211106.
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 3 ways as a sum of consecutive naturals, for example, 47750027504 + ... + 47750027547.
It is an arithmetic number, because the mean of its divisors is an integer number (429750247734).
Almost surely, 22101001211122 is an apocalyptic number.
2101001211122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2101001211122 is a deficient number, since it is larger than the sum of its proper divisors (1337000770750).
2101001211122 is a wasteful number, since it uses less digits than its factorization.
2101001211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95500055064.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2101001211122 its reverse (2211121001012), we get a palindrome (4312122212134).
The spelling of 2101001211122 in words is "two trillion, one hundred one billion, one million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •