Base | Representation |
---|---|
bin | 11110110111010101011… |
… | …101010100111111101111 |
3 | 21111202200010220102100211 |
4 | 132313111131110333233 |
5 | 234222302012041421 |
6 | 4302212441203251 |
7 | 306144234326146 |
oct | 36672535247757 |
9 | 7452603812324 |
10 | 2121000112111 |
11 | 7485692a5a41 |
12 | 2a3092790527 |
13 | 1250179c794a |
14 | 7492a97275d |
15 | 3a28ab879e1 |
hex | 1edd5754fef |
2121000112111 has 4 divisors (see below), whose sum is σ = 2122544905992. Its totient is φ = 2119455318232.
The previous prime is 2121000112103. The next prime is 2121000112151. The reversal of 2121000112111 is 1112110001212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2121000112111 - 23 = 2121000112103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2121000112091 and 2121000112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121000112151) 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 3 ways as a sum of consecutive naturals, for example, 772394881 + ... + 772397626.
It is an arithmetic number, because the mean of its divisors is an integer number (530636226498).
Almost surely, 22121000112111 is an apocalyptic number.
2121000112111 is a deficient number, since it is larger than the sum of its proper divisors (1544793881).
2121000112111 is a wasteful number, since it uses less digits than its factorization.
2121000112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544793880.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2121000112111 its reverse (1112110001212), we get a palindrome (3233110113323).
The spelling of 2121000112111 in words is "two trillion, one hundred twenty-one billion, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •