Base | Representation |
---|---|
bin | 1100101001101111011001… |
… | …0001100110101100110111 |
3 | 1211020220022221122012200012 |
4 | 3022123312101212230313 |
5 | 3310410202343231201 |
6 | 45330422240410435 |
7 | 2634024252153323 |
oct | 312336621465467 |
9 | 54226287565605 |
10 | 13911235914551 |
11 | 44837a4010488 |
12 | 1688110916a1b |
13 | 79ba931bc271 |
14 | 36144376c983 |
15 | 191ce33035bb |
hex | ca6f6466b37 |
13911235914551 has 2 divisors, whose sum is σ = 13911235914552. Its totient is φ = 13911235914550.
The previous prime is 13911235914469. The next prime is 13911235914557. The reversal of 13911235914551 is 15541953211931.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13911235914551 - 230 = 13910162172727 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13911235914551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13911235914557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6955617957275 + 6955617957276.
It is an arithmetic number, because the mean of its divisors is an integer number (6955617957276).
Almost surely, 213911235914551 is an apocalyptic number.
13911235914551 is a deficient number, since it is larger than the sum of its proper divisors (1).
13911235914551 is an equidigital number, since it uses as much as digits as its factorization.
13911235914551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 729000, while the sum is 50.
The spelling of 13911235914551 in words is "thirteen trillion, nine hundred eleven billion, two hundred thirty-five million, nine hundred fourteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •