Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …100011001100011010011 |
3 | 21111212020211202122221020 |
4 | 132320101010121203103 |
5 | 234231324023211011 |
6 | 4302500004530523 |
7 | 306211100115624 |
oct | 36702104314323 |
9 | 7455224678836 |
10 | 2122000210131 |
11 | 748a3188642a |
12 | 2a33116b0a43 |
13 | 125146c6a619 |
14 | 749c3707a4b |
15 | 3a2e8888006 |
hex | 1ee111198d3 |
2122000210131 has 16 divisors (see below), whose sum is σ = 2936247987360. Its totient is φ = 1361521324800.
The previous prime is 2122000210091. The next prime is 2122000210133. The reversal of 2122000210131 is 1310120002212.
It is not a de Polignac number, because 2122000210131 - 26 = 2122000210067 is a prime.
It is a super-2 number, since 2×21220002101312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2122000210131.
It is not an unprimeable number, because it can be changed into a prime (2122000210133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38935720 + ... + 38990181.
It is an arithmetic number, because the mean of its divisors is an integer number (183515499210).
Almost surely, 22122000210131 is an apocalyptic number.
2122000210131 is a deficient number, since it is larger than the sum of its proper divisors (814247777229).
2122000210131 is a wasteful number, since it uses less digits than its factorization.
2122000210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77926246.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2122000210131 its reverse (1310120002212), we get a palindrome (3432120212343).
The spelling of 2122000210131 in words is "two trillion, one hundred twenty-two billion, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •