Base | Representation |
---|---|
bin | 11011000010100011… |
… | …00110010001100101 |
3 | 1101110201010012000102 |
4 | 31201101212101211 |
5 | 214212311430221 |
6 | 10400255353445 |
7 | 1022512441241 |
oct | 154121462145 |
9 | 41421105012 |
10 | 14516905061 |
11 | 617a4616aa |
12 | 2991822885 |
13 | 14a4732769 |
14 | 9b9dcd421 |
15 | 59e6da30b |
hex | 361466465 |
14516905061 has 2 divisors, whose sum is σ = 14516905062. Its totient is φ = 14516905060.
The previous prime is 14516905037. The next prime is 14516905121. The reversal of 14516905061 is 16050961541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7431474436 + 7085430625 = 86206^2 + 84175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14516905061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14516905031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7258452530 + 7258452531.
It is an arithmetic number, because the mean of its divisors is an integer number (7258452531).
Almost surely, 214516905061 is an apocalyptic number.
It is an amenable number.
14516905061 is a deficient number, since it is larger than the sum of its proper divisors (1).
14516905061 is an equidigital number, since it uses as much as digits as its factorization.
14516905061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 14516905061 in words is "fourteen billion, five hundred sixteen million, nine hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •