Base | Representation |
---|---|
bin | 11111000001100101101… |
… | …101100011100111111111 |
3 | 21112211002110100212001122 |
4 | 133001211231203213333 |
5 | 234412324104020111 |
6 | 4311233150101155 |
7 | 310014125601146 |
oct | 37014555434777 |
9 | 7484073325048 |
10 | 2132010220031 |
11 | 7521a9207a8a |
12 | 2a5245aaa7bb |
13 | 126080a50cc3 |
14 | 75292d1475d |
15 | 3a6d2571cdb |
hex | 1f065b639ff |
2132010220031 has 2 divisors, whose sum is σ = 2132010220032. Its totient is φ = 2132010220030.
The previous prime is 2132010219961. The next prime is 2132010220033. The reversal of 2132010220031 is 1300220102312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2132010220031 - 214 = 2132010203647 is a prime.
It is a super-2 number, since 2×21320102200312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 2132010220033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2132010219991 and 2132010220009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2132010220033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066005110015 + 1066005110016.
It is an arithmetic number, because the mean of its divisors is an integer number (1066005110016).
Almost surely, 22132010220031 is an apocalyptic number.
2132010220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132010220031 is an equidigital number, since it uses as much as digits as its factorization.
2132010220031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2132010220031 its reverse (1300220102312), we get a palindrome (3432230322343).
The spelling of 2132010220031 in words is "two trillion, one hundred thirty-two billion, ten million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •