Base | Representation |
---|---|
bin | 1110111010111010100000… |
… | …1010110101000001001001 |
3 | 2011002022221200002000011101 |
4 | 3232232220022311001021 |
5 | 4122241024141424223 |
6 | 54520254054101401 |
7 | 3312146444031445 |
oct | 356565012650111 |
9 | 64068850060141 |
10 | 16405301514313 |
11 | 52554a4023a58 |
12 | 1a0b55a34a861 |
13 | 92002329336a |
14 | 40a04122b825 |
15 | 1d6b15e384ad |
hex | eeba82b5049 |
16405301514313 has 2 divisors, whose sum is σ = 16405301514314. Its totient is φ = 16405301514312.
The previous prime is 16405301514289. The next prime is 16405301514317. The reversal of 16405301514313 is 31341510350461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16343002851904 + 62298662409 = 4042648^2 + 249597^2 .
It is an emirp because it is prime and its reverse (31341510350461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16405301514313 - 217 = 16405301383241 is a prime.
It is not a weakly prime, because it can be changed into another prime (16405301514317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8202650757156 + 8202650757157.
It is an arithmetic number, because the mean of its divisors is an integer number (8202650757157).
Almost surely, 216405301514313 is an apocalyptic number.
It is an amenable number.
16405301514313 is a deficient number, since it is larger than the sum of its proper divisors (1).
16405301514313 is an equidigital number, since it uses as much as digits as its factorization.
16405301514313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 16405301514313 its reverse (31341510350461), we get a palindrome (47746811864774).
The spelling of 16405301514313 in words is "sixteen trillion, four hundred five billion, three hundred one million, five hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •