Base | Representation |
---|---|
bin | 1011111100110111100101… |
… | …1100110010111110111111 |
3 | 1201112012112001202202220212 |
4 | 2333031321130302332333 |
5 | 3210242410143103323 |
6 | 43540331240303035 |
7 | 2524233636530162 |
oct | 277157134627677 |
9 | 51465461682825 |
10 | 13140342550463 |
11 | 4206873890097 |
12 | 158282a171a7b |
13 | 74418a4c589b |
14 | 335dd2d41ad9 |
15 | 17bc254beb78 |
hex | bf379732fbf |
13140342550463 has 2 divisors, whose sum is σ = 13140342550464. Its totient is φ = 13140342550462.
The previous prime is 13140342550421. The next prime is 13140342550537. The reversal of 13140342550463 is 36405524304131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13140342550463 - 212 = 13140342546367 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13140342550463.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13140342550763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6570171275231 + 6570171275232.
It is an arithmetic number, because the mean of its divisors is an integer number (6570171275232).
Almost surely, 213140342550463 is an apocalyptic number.
13140342550463 is a deficient number, since it is larger than the sum of its proper divisors (1).
13140342550463 is an equidigital number, since it uses as much as digits as its factorization.
13140342550463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 41.
Adding to 13140342550463 its reverse (36405524304131), we get a palindrome (49545866854594).
The spelling of 13140342550463 in words is "thirteen trillion, one hundred forty billion, three hundred forty-two million, five hundred fifty thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •