Base | Representation |
---|---|
bin | 11110000100000011100101… |
… | …011110110101100111010011 |
3 | 122100011010020201200201010122 |
4 | 132010003211132311213103 |
5 | 114312243303031301301 |
6 | 1145113030333220455 |
7 | 36564405625352465 |
oct | 3604034536654723 |
9 | 570133221621118 |
10 | 132220123306451 |
11 | 3914726a6a9194 |
12 | 129b518b93172b |
13 | 58a13c522723b |
14 | 24916b9552135 |
15 | 10445374c181b |
hex | 7840e57b59d3 |
132220123306451 has 2 divisors, whose sum is σ = 132220123306452. Its totient is φ = 132220123306450.
The previous prime is 132220123306423. The next prime is 132220123306529. The reversal of 132220123306451 is 154603321022231.
It is a weak prime.
It is an emirp because it is prime and its reverse (154603321022231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132220123306451 - 26 = 132220123306387 is a prime.
It is a super-2 number, since 2×1322201233064512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132220123306151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110061653225 + 66110061653226.
It is an arithmetic number, because the mean of its divisors is an integer number (66110061653226).
Almost surely, 2132220123306451 is an apocalyptic number.
132220123306451 is a deficient number, since it is larger than the sum of its proper divisors (1).
132220123306451 is an equidigital number, since it uses as much as digits as its factorization.
132220123306451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 132220123306451 its reverse (154603321022231), we get a palindrome (286823444328682).
The spelling of 132220123306451 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred twenty-three million, three hundred six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •