Base | Representation |
---|---|
bin | 11110000010110000100101… |
… | …011100111010101000100011 |
3 | 122022211121012201200000021122 |
4 | 132002300211130322220203 |
5 | 114304313243032400311 |
6 | 1145004051111242455 |
7 | 36555102260620235 |
oct | 3602604534725043 |
9 | 568747181600248 |
10 | 132131002231331 |
11 | 391124971253a4 |
12 | 1299ba5937942b |
13 | 5895b9152ca6c |
14 | 248b263286255 |
15 | 104206d3ac0db |
hex | 782c2573aa23 |
132131002231331 has 2 divisors, whose sum is σ = 132131002231332. Its totient is φ = 132131002231330.
The previous prime is 132131002231307. The next prime is 132131002231351. The reversal of 132131002231331 is 133132200131231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132131002231331 is a prime.
It is a super-2 number, since 2×1321310022313312 (a number of 29 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 132131002231331.
It is not a weakly prime, because it can be changed into another prime (132131002231301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66065501115665 + 66065501115666.
It is an arithmetic number, because the mean of its divisors is an integer number (66065501115666).
Almost surely, 2132131002231331 is an apocalyptic number.
132131002231331 is a deficient number, since it is larger than the sum of its proper divisors (1).
132131002231331 is an equidigital number, since it uses as much as digits as its factorization.
132131002231331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 132131002231331 its reverse (133132200131231), we get a palindrome (265263202362562).
The spelling of 132131002231331 in words is "one hundred thirty-two trillion, one hundred thirty-one billion, two million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •