Base | Representation |
---|---|
bin | 1100011111111000000… |
… | …0111101111101001011 |
3 | 202112012212021101122221 |
4 | 3013332000331331023 |
5 | 12004214024023024 |
6 | 242345544554511 |
7 | 21340560634432 |
oct | 3077600757513 |
9 | 675185241587 |
10 | 214715064139 |
11 | 83073068734 |
12 | 35743782a37 |
13 | 1732ab13014 |
14 | a56c534119 |
15 | 58ba2533e4 |
hex | 31fe03df4b |
214715064139 has 2 divisors, whose sum is σ = 214715064140. Its totient is φ = 214715064138.
The previous prime is 214715064107. The next prime is 214715064167. The reversal of 214715064139 is 931460517412.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 214715064139 - 25 = 214715064107 is a prime.
It is a super-2 number, since 2×2147150641392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 214715064095 and 214715064104.
It is not a weakly prime, because it can be changed into another prime (214715065139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107357532069 + 107357532070.
It is an arithmetic number, because the mean of its divisors is an integer number (107357532070).
Almost surely, 2214715064139 is an apocalyptic number.
214715064139 is a deficient number, since it is larger than the sum of its proper divisors (1).
214715064139 is an equidigital number, since it uses as much as digits as its factorization.
214715064139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 43.
The spelling of 214715064139 in words is "two hundred fourteen billion, seven hundred fifteen million, sixty-four thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •