Base | Representation |
---|---|
bin | 11111000000110110000… |
… | …101101001111100011001 |
3 | 21112202000202221000011100 |
4 | 133000312011221330121 |
5 | 234404210033343001 |
6 | 4311022005022013 |
7 | 306655254365106 |
oct | 37006605517431 |
9 | 7482022830140 |
10 | 2131211231001 |
11 | 7519291a7776 |
12 | 2a50623b4909 |
13 | 125c84363328 |
14 | 75218b6daad |
15 | 3a687349586 |
hex | 1f036169f19 |
2131211231001 has 24 divisors (see below), whose sum is σ = 3119116605696. Its totient is φ = 1402062377760.
The previous prime is 2131211230991. The next prime is 2131211231011. The reversal of 2131211231001 is 1001321121312.
It is an interprime number because it is at equal distance from previous prime (2131211230991) and next prime (2131211231011).
It is not a de Polignac number, because 2131211231001 - 214 = 2131211214617 is a prime.
It is a super-2 number, since 2×21312112310012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2131211231011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1008310 + ... + 2297631.
It is an arithmetic number, because the mean of its divisors is an integer number (129963191904).
Almost surely, 22131211231001 is an apocalyptic number.
It is an amenable number.
2131211231001 is a deficient number, since it is larger than the sum of its proper divisors (987905374695).
2131211231001 is a wasteful number, since it uses less digits than its factorization.
2131211231001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3306893 (or 3306890 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 2131211231001 its reverse (1001321121312), we get a palindrome (3132532352313).
The spelling of 2131211231001 in words is "two trillion, one hundred thirty-one billion, two hundred eleven million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •