Base | Representation |
---|---|
bin | 1100101001101110111011… |
… | …1011001110010101010001 |
3 | 1211020220000100121112120222 |
4 | 3022123232323032111101 |
5 | 3310404424311411212 |
6 | 45330402113442425 |
7 | 2634021224105261 |
oct | 312335673162521 |
9 | 54226010545528 |
10 | 13911112607057 |
11 | 448374044a766 |
12 | 1688097570415 |
13 | 79ba737a7a53 |
14 | 3614312317a1 |
15 | 191cd7597c72 |
hex | ca6eeece551 |
13911112607057 has 2 divisors, whose sum is σ = 13911112607058. Its totient is φ = 13911112607056.
The previous prime is 13911112607033. The next prime is 13911112607123. The reversal of 13911112607057 is 75070621111931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12004589575696 + 1906523031361 = 3464764^2 + 1380769^2 .
It is a cyclic number.
It is not a de Polignac number, because 13911112607057 - 222 = 13911108412753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13911112606999 and 13911112607017.
It is not a weakly prime, because it can be changed into another prime (13911112607957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6955556303528 + 6955556303529.
It is an arithmetic number, because the mean of its divisors is an integer number (6955556303529).
Almost surely, 213911112607057 is an apocalyptic number.
It is an amenable number.
13911112607057 is a deficient number, since it is larger than the sum of its proper divisors (1).
13911112607057 is an equidigital number, since it uses as much as digits as its factorization.
13911112607057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 44.
Adding to 13911112607057 its reverse (75070621111931), we get a palindrome (88981733718988).
The spelling of 13911112607057 in words is "thirteen trillion, nine hundred eleven billion, one hundred twelve million, six hundred seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •