Base | Representation |
---|---|
bin | 1100100111110110110001… |
… | …0001100000101001101001 |
3 | 1211010210202022212011012112 |
4 | 3021331230101200221221 |
5 | 3304342344100103024 |
6 | 45303505223452105 |
7 | 2631466662233333 |
oct | 311755421405151 |
9 | 54123668764175 |
10 | 13878855862889 |
11 | 4470a9834a406 |
12 | 16819948b7035 |
13 | 798a02a04294 |
14 | 35da511b8453 |
15 | 19104a79400e |
hex | c9f6c460a69 |
13878855862889 has 2 divisors, whose sum is σ = 13878855862890. Its totient is φ = 13878855862888.
The previous prime is 13878855862769. The next prime is 13878855862891. The reversal of 13878855862889 is 98826855887831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13310238822400 + 568617040489 = 3648320^2 + 754067^2 .
It is a cyclic number.
It is not a de Polignac number, because 13878855862889 - 28 = 13878855862633 is a prime.
Together with 13878855862891, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13878855862889.
It is not a weakly prime, because it can be changed into another prime (13878855862489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6939427931444 + 6939427931445.
It is an arithmetic number, because the mean of its divisors is an integer number (6939427931445).
Almost surely, 213878855862889 is an apocalyptic number.
It is an amenable number.
13878855862889 is a deficient number, since it is larger than the sum of its proper divisors (1).
13878855862889 is an equidigital number, since it uses as much as digits as its factorization.
13878855862889 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14863564800, while the sum is 86.
The spelling of 13878855862889 in words is "thirteen trillion, eight hundred seventy-eight billion, eight hundred fifty-five million, eight hundred sixty-two thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •