Base | Representation |
---|---|
bin | 11110000011111100010100… |
… | …011111010000111111000111 |
3 | 122100010101010001011221112212 |
4 | 132003330110133100333013 |
5 | 114312131313413410002 |
6 | 1145105300252334035 |
7 | 36564011406432206 |
oct | 3603742437207707 |
9 | 570111101157485 |
10 | 132212322013127 |
11 | 39143a27010034 |
12 | 129b377317431b |
13 | 58a0750c07845 |
14 | 249117941123d |
15 | 104422c677352 |
hex | 783f147d0fc7 |
132212322013127 has 2 divisors, whose sum is σ = 132212322013128. Its totient is φ = 132212322013126.
The previous prime is 132212322013073. The next prime is 132212322013183. The reversal of 132212322013127 is 721310223212231.
It is a weak prime.
It is an emirp because it is prime and its reverse (721310223212231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132212322013127 - 26 = 132212322013063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132212322013093 and 132212322013102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132212322013427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66106161006563 + 66106161006564.
It is an arithmetic number, because the mean of its divisors is an integer number (66106161006564).
Almost surely, 2132212322013127 is an apocalyptic number.
132212322013127 is a deficient number, since it is larger than the sum of its proper divisors (1).
132212322013127 is an equidigital number, since it uses as much as digits as its factorization.
132212322013127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 132212322013127 its reverse (721310223212231), we get a palindrome (853522545225358).
The spelling of 132212322013127 in words is "one hundred thirty-two trillion, two hundred twelve billion, three hundred twenty-two million, thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •