Base | Representation |
---|---|
bin | 1011110101111001101000… |
… | …1011110010000101001001 |
3 | 1201002202112021110221212112 |
4 | 2331132122023302011021 |
5 | 3201312223424413103 |
6 | 43405332425552105 |
7 | 2512465262306135 |
oct | 275363213620511 |
9 | 51082467427775 |
10 | 13020632654153 |
11 | 4170023760193 |
12 | 156359b645635 |
13 | 735ac0452a07 |
14 | 3302b83543c5 |
15 | 178a6ac20cd8 |
hex | bd79a2f2149 |
13020632654153 has 2 divisors, whose sum is σ = 13020632654154. Its totient is φ = 13020632654152.
The previous prime is 13020632654119. The next prime is 13020632654201. The reversal of 13020632654153 is 35145623602031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10508670757264 + 2511961896889 = 3241708^2 + 1584917^2 .
It is a cyclic number.
It is not a de Polignac number, because 13020632654153 - 210 = 13020632653129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13020632654153.
It is not a weakly prime, because it can be changed into another prime (13020632654053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510316327076 + 6510316327077.
It is an arithmetic number, because the mean of its divisors is an integer number (6510316327077).
Almost surely, 213020632654153 is an apocalyptic number.
It is an amenable number.
13020632654153 is a deficient number, since it is larger than the sum of its proper divisors (1).
13020632654153 is an equidigital number, since it uses as much as digits as its factorization.
13020632654153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 13020632654153 in words is "thirteen trillion, twenty billion, six hundred thirty-two million, six hundred fifty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •