Base | Representation |
---|---|
bin | 11111000000111101010… |
… | …010011001011111100001 |
3 | 21112202100012012022112201 |
4 | 133000331102121133201 |
5 | 234404431443341001 |
6 | 4311042001453201 |
7 | 306661252121233 |
oct | 37007522313741 |
9 | 7482305168481 |
10 | 2131332012001 |
11 | 7519903a2285 |
12 | 2a5096941201 |
13 | 125ca33a188a |
14 | 7522ac10253 |
15 | 3a692c56501 |
hex | 1f03d4997e1 |
2131332012001 has 2 divisors, whose sum is σ = 2131332012002. Its totient is φ = 2131332012000.
The previous prime is 2131332011929. The next prime is 2131332012031. The reversal of 2131332012001 is 1002102331312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1112605149601 + 1018726862400 = 1054801^2 + 1009320^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131332012001 - 27 = 2131332011873 is a prime.
It is a super-2 number, since 2×21313320120012 (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 2131332012001.
It is not a weakly prime, because it can be changed into another prime (2131332012031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065666006000 + 1065666006001.
It is an arithmetic number, because the mean of its divisors is an integer number (1065666006001).
Almost surely, 22131332012001 is an apocalyptic number.
It is an amenable number.
2131332012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131332012001 is an equidigital number, since it uses as much as digits as its factorization.
2131332012001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2131332012001 its reverse (1002102331312), we get a palindrome (3133434343313).
The spelling of 2131332012001 in words is "two trillion, one hundred thirty-one billion, three hundred thirty-two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •