Base | Representation |
---|---|
bin | 1101011100011010110010… |
… | …1000000010000100010001 |
3 | 1221100010121112112021100111 |
4 | 3113012230220002010101 |
5 | 3414141241413002123 |
6 | 51234411251521321 |
7 | 3053645506215646 |
oct | 327065450020421 |
9 | 57303545467314 |
10 | 14781878640913 |
11 | 4789a6114805a |
12 | 17a89b12b9241 |
13 | 832c047bb627 |
14 | 391637c15dcd |
15 | 1a979d36390d |
hex | d71aca02111 |
14781878640913 has 2 divisors, whose sum is σ = 14781878640914. Its totient is φ = 14781878640912.
The previous prime is 14781878640887. The next prime is 14781878640929. The reversal of 14781878640913 is 31904687818741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12763385017744 + 2018493623169 = 3572588^2 + 1420737^2 .
It is an emirp because it is prime and its reverse (31904687818741) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14781878640913 - 241 = 12582855385361 is a prime.
It is not a weakly prime, because it can be changed into another prime (14781878040913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7390939320456 + 7390939320457.
It is an arithmetic number, because the mean of its divisors is an integer number (7390939320457).
Almost surely, 214781878640913 is an apocalyptic number.
It is an amenable number.
14781878640913 is a deficient number, since it is larger than the sum of its proper divisors (1).
14781878640913 is an equidigital number, since it uses as much as digits as its factorization.
14781878640913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65028096, while the sum is 67.
The spelling of 14781878640913 in words is "fourteen trillion, seven hundred eighty-one billion, eight hundred seventy-eight million, six hundred forty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •