Base | Representation |
---|---|
bin | 11011110111110111… |
… | …01101001011110111 |
3 | 1102121212200122010222 |
4 | 31323323231023313 |
5 | 221121310313111 |
6 | 10512513404555 |
7 | 1036553120324 |
oct | 157373551367 |
9 | 42555618128 |
10 | 14964151031 |
11 | 6389967175 |
12 | 2a9756975b |
13 | 15462a6a4b |
14 | a1d571b4b |
15 | 5c8ad27db |
hex | 37beed2f7 |
14964151031 has 2 divisors, whose sum is σ = 14964151032. Its totient is φ = 14964151030.
The previous prime is 14964150983. The next prime is 14964151079. The reversal of 14964151031 is 13015146941.
It is a balanced prime because it is at equal distance from previous prime (14964150983) and next prime (14964151079).
It is a cyclic number.
It is not a de Polignac number, because 14964151031 - 210 = 14964150007 is a prime.
It is a super-2 number, since 2×149641510312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14964150982 and 14964151000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14924151031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7482075515 + 7482075516.
It is an arithmetic number, because the mean of its divisors is an integer number (7482075516).
Almost surely, 214964151031 is an apocalyptic number.
14964151031 is a deficient number, since it is larger than the sum of its proper divisors (1).
14964151031 is an equidigital number, since it uses as much as digits as its factorization.
14964151031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
Adding to 14964151031 its reverse (13015146941), we get a palindrome (27979297972).
The spelling of 14964151031 in words is "fourteen billion, nine hundred sixty-four million, one hundred fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •