Base | Representation |
---|---|
bin | 11110111000010001110… |
… | …001011000011100111111 |
3 | 21111212021122221202111020 |
4 | 132320101301120130333 |
5 | 234231340033031421 |
6 | 4302501105355223 |
7 | 306211302260601 |
oct | 36702161303477 |
9 | 7455248852436 |
10 | 2122012002111 |
11 | 748a384aa971 |
12 | 2a3315638b13 |
13 | 125149538a21 |
14 | 749c50d7171 |
15 | 3a2e9916dc6 |
hex | 1ee11c5873f |
2122012002111 has 8 divisors (see below), whose sum is σ = 2926913106480. Its totient is φ = 1365892782912.
The previous prime is 2122012002091. The next prime is 2122012002133. The reversal of 2122012002111 is 1112002102212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2122012002111 - 237 = 1984573048639 is a prime.
It is a super-4 number, since 4×21220120021114 (a number of 50 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122012002151) 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 7 ways as a sum of consecutive naturals, for example, 12195471190 + ... + 12195471363.
It is an arithmetic number, because the mean of its divisors is an integer number (365864138310).
Almost surely, 22122012002111 is an apocalyptic number.
2122012002111 is a deficient number, since it is larger than the sum of its proper divisors (804901104369).
2122012002111 is a wasteful number, since it uses less digits than its factorization.
2122012002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24390942585.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2122012002111 its reverse (1112002102212), we get a palindrome (3234014104323).
The spelling of 2122012002111 in words is "two trillion, one hundred twenty-two billion, twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •