Base | Representation |
---|---|
bin | 1011111010100101011110… |
… | …1010100010100011001111 |
3 | 1201101110021122112200211102 |
4 | 2332221113222202203033 |
5 | 3204122043440202114 |
6 | 43510323311013315 |
7 | 2521344664200152 |
oct | 276512752424317 |
9 | 51343248480742 |
10 | 13101121022159 |
11 | 41a11772a9395 |
12 | 1577102b0a23b |
13 | 7405797c9281 |
14 | 334151cd7c99 |
15 | 17abcc00b2de |
hex | bea57aa28cf |
13101121022159 has 2 divisors, whose sum is σ = 13101121022160. Its totient is φ = 13101121022158.
The previous prime is 13101121022123. The next prime is 13101121022203. The reversal of 13101121022159 is 95122012110131.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (95122012110131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13101121022159 - 220 = 13101119973583 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13101121042159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550560511079 + 6550560511080.
It is an arithmetic number, because the mean of its divisors is an integer number (6550560511080).
Almost surely, 213101121022159 is an apocalyptic number.
13101121022159 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101121022159 is an equidigital number, since it uses as much as digits as its factorization.
13101121022159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 29.
The spelling of 13101121022159 in words is "thirteen trillion, one hundred one billion, one hundred twenty-one million, twenty-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •