Base | Representation |
---|---|
bin | 11011000010010101… |
… | …01110010100010001 |
3 | 1101110120201122001011 |
4 | 31201022232110101 |
5 | 214211331243433 |
6 | 10400153010521 |
7 | 1022461224346 |
oct | 154112562421 |
9 | 41416648034 |
10 | 14515102993 |
11 | 6179440796 |
12 | 29910b3a41 |
13 | 14a4251451 |
14 | 9b9a807cd |
15 | 59e4813cd |
hex | 3612ae511 |
14515102993 has 2 divisors, whose sum is σ = 14515102994. Its totient is φ = 14515102992.
The previous prime is 14515102879. The next prime is 14515103011. The reversal of 14515102993 is 39920151541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12847769104 + 1667333889 = 113348^2 + 40833^2 .
It is a cyclic number.
It is not a de Polignac number, because 14515102993 - 221 = 14513005841 is a prime.
It is not a weakly prime, because it can be changed into another prime (14515102493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7257551496 + 7257551497.
It is an arithmetic number, because the mean of its divisors is an integer number (7257551497).
Almost surely, 214515102993 is an apocalyptic number.
It is an amenable number.
14515102993 is a deficient number, since it is larger than the sum of its proper divisors (1).
14515102993 is an equidigital number, since it uses as much as digits as its factorization.
14515102993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 40.
The spelling of 14515102993 in words is "fourteen billion, five hundred fifteen million, one hundred two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •