Base | Representation |
---|---|
bin | 11110000001010010101000… |
… | …011101101011011000111111 |
3 | 122022110221211010220001202012 |
4 | 132001102220131223120333 |
5 | 114301140141440444411 |
6 | 1144445444505121435 |
7 | 36544601323563233 |
oct | 3601225035533077 |
9 | 568427733801665 |
10 | 132030121031231 |
11 | 39083729338655 |
12 | 129843a448927b |
13 | 58895052a9a57 |
14 | 24864131a05c3 |
15 | 103e616b0b18b |
hex | 7814a876b63f |
132030121031231 has 2 divisors, whose sum is σ = 132030121031232. Its totient is φ = 132030121031230.
The previous prime is 132030121031161. The next prime is 132030121031239. The reversal of 132030121031231 is 132130121030231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132030121031231 is a prime.
It is a super-2 number, since 2×1320301210312312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132030121031197 and 132030121031206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132030121031239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66015060515615 + 66015060515616.
It is an arithmetic number, because the mean of its divisors is an integer number (66015060515616).
Almost surely, 2132030121031231 is an apocalyptic number.
132030121031231 is a deficient number, since it is larger than the sum of its proper divisors (1).
132030121031231 is an equidigital number, since it uses as much as digits as its factorization.
132030121031231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 132030121031231 its reverse (132130121030231), we get a palindrome (264160242061462).
The spelling of 132030121031231 in words is "one hundred thirty-two trillion, thirty billion, one hundred twenty-one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •