Base | Representation |
---|---|
bin | 11110110111010101100… |
… | …000110011001000111011 |
3 | 21111202200012121122111211 |
4 | 132313111200303020323 |
5 | 234222302230201021 |
6 | 4302212512503551 |
7 | 306144245136004 |
oct | 36672540631073 |
9 | 7452605548454 |
10 | 2121001022011 |
11 | 748569867623 |
12 | 2a3092b4abb7 |
13 | 125017c55b51 |
14 | 7492ab2c1ab |
15 | 3a28acb73e1 |
hex | 1edd583323b |
2121001022011 has 4 divisors (see below), whose sum is σ = 2121888844000. Its totient is φ = 2120113200024.
The previous prime is 2121001021991. The next prime is 2121001022083. The reversal of 2121001022011 is 1102201001212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2121001022011 - 29 = 2121001021499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2121001021982 and 2121001022000.
It is not an unprimeable number, because it can be changed into a prime (2121001022911) 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 3 ways as a sum of consecutive naturals, for example, 443907411 + ... + 443912188.
It is an arithmetic number, because the mean of its divisors is an integer number (530472211000).
Almost surely, 22121001022011 is an apocalyptic number.
2121001022011 is a deficient number, since it is larger than the sum of its proper divisors (887821989).
2121001022011 is an equidigital number, since it uses as much as digits as its factorization.
2121001022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 887821988.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2121001022011 its reverse (1102201001212), we get a palindrome (3223202023223).
The spelling of 2121001022011 in words is "two trillion, one hundred twenty-one billion, one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •