Base | Representation |
---|---|
bin | 11011011000010011… |
… | …00110011011100111 |
3 | 1101221102102202021222 |
4 | 31230021212123213 |
5 | 220101013423202 |
6 | 10430334130555 |
7 | 1030156323632 |
oct | 155411463347 |
9 | 41842382258 |
10 | 14699357927 |
11 | 626344a1a1 |
12 | 2a22950a5b |
13 | 1503484c37 |
14 | 9d6324c19 |
15 | 5b072a4a2 |
hex | 36c2666e7 |
14699357927 has 2 divisors, whose sum is σ = 14699357928. Its totient is φ = 14699357926.
The previous prime is 14699357917. The next prime is 14699357971. The reversal of 14699357927 is 72975399641.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14699357927 - 28 = 14699357671 is a prime.
It is a super-2 number, since 2×146993579272 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14699357927.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14699357917) 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, 7349678963 + 7349678964.
It is an arithmetic number, because the mean of its divisors is an integer number (7349678964).
Almost surely, 214699357927 is an apocalyptic number.
14699357927 is a deficient number, since it is larger than the sum of its proper divisors (1).
14699357927 is an equidigital number, since it uses as much as digits as its factorization.
14699357927 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25719120, while the sum is 62.
The spelling of 14699357927 in words is "fourteen billion, six hundred ninety-nine million, three hundred fifty-seven thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •