Base | Representation |
---|---|
bin | 111000000100001100… |
… | …1100110101101001101 |
3 | 102111202212212102202121 |
4 | 1300020121212231031 |
5 | 3433034400423112 |
6 | 131151102052541 |
7 | 11461424143303 |
oct | 1601031465515 |
9 | 374685772677 |
10 | 120400014157 |
11 | 4707473a735 |
12 | 1b40187a151 |
13 | b47a032237 |
14 | 5b82512273 |
15 | 31ea16d407 |
hex | 1c08666b4d |
120400014157 has 2 divisors, whose sum is σ = 120400014158. Its totient is φ = 120400014156.
The previous prime is 120400014127. The next prime is 120400014173. The reversal of 120400014157 is 751410004021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110370792841 + 10029221316 = 332221^2 + 100146^2 .
It is an emirp because it is prime and its reverse (751410004021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120400014157 - 215 = 120399981389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120400014127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60200007078 + 60200007079.
It is an arithmetic number, because the mean of its divisors is an integer number (60200007079).
Almost surely, 2120400014157 is an apocalyptic number.
It is an amenable number.
120400014157 is a deficient number, since it is larger than the sum of its proper divisors (1).
120400014157 is an equidigital number, since it uses as much as digits as its factorization.
120400014157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 120400014157 its reverse (751410004021), we get a palindrome (871810018178).
The spelling of 120400014157 in words is "one hundred twenty billion, four hundred million, fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •