Base | Representation |
---|---|
bin | 11111000000110110001… |
… | …000101000001000100111 |
3 | 21112202000211101120210000 |
4 | 133000312020220020213 |
5 | 234404210233310043 |
6 | 4311022033432343 |
7 | 306655264121235 |
oct | 37006610501047 |
9 | 7482024346700 |
10 | 2131212010023 |
11 | 751929689a98 |
12 | 2a506270b6b3 |
13 | 125c84576aa5 |
14 | 75218cd3955 |
15 | 3a6874502d3 |
hex | 1f036228227 |
2131212010023 has 20 divisors (see below), whose sum is σ = 3184331938480. Its totient is φ = 1420509197952.
The previous prime is 2131212009977. The next prime is 2131212010121. The reversal of 2131212010023 is 3200102121312.
It is not a de Polignac number, because 2131212010023 - 210 = 2131212008999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131212009978 and 2131212010005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131212010723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2378890 + ... + 3149847.
It is an arithmetic number, because the mean of its divisors is an integer number (159216596924).
Almost surely, 22131212010023 is an apocalyptic number.
2131212010023 is a deficient number, since it is larger than the sum of its proper divisors (1053119928457).
2131212010023 is an equidigital number, since it uses as much as digits as its factorization.
2131212010023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5533508 (or 5533499 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2131212010023 its reverse (3200102121312), we get a palindrome (5331314131335).
The spelling of 2131212010023 in words is "two trillion, one hundred thirty-one billion, two hundred twelve million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •