Base | Representation |
---|---|
bin | 11110000101001111000111… |
… | …010010000010101011101011 |
3 | 122100102212120120100010011001 |
4 | 132011033013102002223223 |
5 | 114320110400034424001 |
6 | 1145214201502415431 |
7 | 36603306406452412 |
oct | 3605170722025353 |
9 | 570385516303131 |
10 | 132301221014251 |
11 | 391786a61a43a3 |
12 | 12a08a43291577 |
13 | 58a8c4a8b95a3 |
14 | 24955addd0479 |
15 | 10466d2022001 |
hex | 7853c7482aeb |
132301221014251 has 2 divisors, whose sum is σ = 132301221014252. Its totient is φ = 132301221014250.
The previous prime is 132301221014243. The next prime is 132301221014279. The reversal of 132301221014251 is 152410122103231.
It is an a-pointer prime, because the next prime (132301221014279) can be obtained adding 132301221014251 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132301221014251 - 23 = 132301221014243 is a prime.
It is a super-2 number, since 2×1323012210142512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132301221014201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66150610507125 + 66150610507126.
It is an arithmetic number, because the mean of its divisors is an integer number (66150610507126).
Almost surely, 2132301221014251 is an apocalyptic number.
132301221014251 is a deficient number, since it is larger than the sum of its proper divisors (1).
132301221014251 is an equidigital number, since it uses as much as digits as its factorization.
132301221014251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 132301221014251 its reverse (152410122103231), we get a palindrome (284711343117482).
The spelling of 132301221014251 in words is "one hundred thirty-two trillion, three hundred one billion, two hundred twenty-one million, fourteen thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •