Base | Representation |
---|---|
bin | 11011000100001111… |
… | …10001011110101011 |
3 | 1101111200211201001012 |
4 | 31202013301132223 |
5 | 214224430403411 |
6 | 10401524014135 |
7 | 1023044240441 |
oct | 154207613653 |
9 | 41450751035 |
10 | 14531106731 |
11 | 6187481619 |
12 | 299653134b |
13 | 14a766590b |
14 | 9bbc48b91 |
15 | 5a0a9318b |
hex | 3621f17ab |
14531106731 has 2 divisors, whose sum is σ = 14531106732. Its totient is φ = 14531106730.
The previous prime is 14531106721. The next prime is 14531106739. The reversal of 14531106731 is 13760113541.
It is a strong prime.
It is an emirp because it is prime and its reverse (13760113541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14531106731 is a prime.
It is a super-2 number, since 2×145311067312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (14531106739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7265553365 + 7265553366.
It is an arithmetic number, because the mean of its divisors is an integer number (7265553366).
Almost surely, 214531106731 is an apocalyptic number.
14531106731 is a deficient number, since it is larger than the sum of its proper divisors (1).
14531106731 is an equidigital number, since it uses as much as digits as its factorization.
14531106731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 14531106731 in words is "fourteen billion, five hundred thirty-one million, one hundred six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •