Base | Representation |
---|---|
bin | 1100000111111010111100… |
… | …0001110100111010010111 |
3 | 1202012100121221201011222011 |
4 | 3001332233001310322113 |
5 | 3221400242310324114 |
6 | 44203452445245051 |
7 | 2544035164363612 |
oct | 301765701647227 |
9 | 52170557634864 |
10 | 13330220011159 |
11 | 427a350750727 |
12 | 15b359b863787 |
13 | 75905a62191c |
14 | 3412868c3179 |
15 | 181b39e2d1c4 |
hex | c1faf074e97 |
13330220011159 has 2 divisors, whose sum is σ = 13330220011160. Its totient is φ = 13330220011158.
The previous prime is 13330220011109. The next prime is 13330220011183. The reversal of 13330220011159 is 95111002203331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13330220011159 - 211 = 13330220009111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13330220011159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13330220011109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665110005579 + 6665110005580.
It is an arithmetic number, because the mean of its divisors is an integer number (6665110005580).
Almost surely, 213330220011159 is an apocalyptic number.
13330220011159 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330220011159 is an equidigital number, since it uses as much as digits as its factorization.
13330220011159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The spelling of 13330220011159 in words is "thirteen trillion, three hundred thirty billion, two hundred twenty million, eleven thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •