Base | Representation |
---|---|
bin | 11011000000110010… |
… | …10001100001010111 |
3 | 1101102200100001010222 |
4 | 31200121101201113 |
5 | 214200021434431 |
6 | 10355011104555 |
7 | 1022243104343 |
oct | 154031214127 |
9 | 41380301128 |
10 | 14502139991 |
11 | 6172097469 |
12 | 29888a215b |
13 | 14a1663031 |
14 | 9b8068623 |
15 | 59d27057b |
hex | 360651857 |
14502139991 has 2 divisors, whose sum is σ = 14502139992. Its totient is φ = 14502139990.
The previous prime is 14502139979. The next prime is 14502140123. The reversal of 14502139991 is 19993120541.
It is a weak prime.
It is an emirp because it is prime and its reverse (19993120541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14502139991 is a prime.
It is a super-2 number, since 2×145021399912 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14502138991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7251069995 + 7251069996.
It is an arithmetic number, because the mean of its divisors is an integer number (7251069996).
Almost surely, 214502139991 is an apocalyptic number.
14502139991 is a deficient number, since it is larger than the sum of its proper divisors (1).
14502139991 is an equidigital number, since it uses as much as digits as its factorization.
14502139991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 44.
The spelling of 14502139991 in words is "fourteen billion, five hundred two million, one hundred thirty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •