Base | Representation |
---|---|
bin | 100100111010110101110000… |
… | …111110101010011010011111 |
3 | 210021220201102220012010222012 |
4 | 210322311300332222122133 |
5 | 132240310134312201002 |
6 | 1333201104340541435 |
7 | 46126033426252256 |
oct | 4472656076523237 |
9 | 707821386163865 |
10 | 162373134100127 |
11 | 47812072160225 |
12 | 162650020b187b |
13 | 6c7a94a909052 |
14 | 2c14c8a0a579d |
15 | 13b8a70351d52 |
hex | 93ad70faa69f |
162373134100127 has 2 divisors, whose sum is σ = 162373134100128. Its totient is φ = 162373134100126.
The previous prime is 162373134100117. The next prime is 162373134100129. The reversal of 162373134100127 is 721001431373261.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 162373134100127 - 228 = 162372865664671 is a prime.
It is a super-2 number, since 2×1623731341001272 (a number of 29 digits) contains 22 as substring.
Together with 162373134100129, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (162373134100129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81186567050063 + 81186567050064.
It is an arithmetic number, because the mean of its divisors is an integer number (81186567050064).
Almost surely, 2162373134100127 is an apocalyptic number.
162373134100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
162373134100127 is an equidigital number, since it uses as much as digits as its factorization.
162373134100127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 127008, while the sum is 41.
Adding to 162373134100127 its reverse (721001431373261), we get a palindrome (883374565473388).
The spelling of 162373134100127 in words is "one hundred sixty-two trillion, three hundred seventy-three billion, one hundred thirty-four million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •