Base | Representation |
---|---|
bin | 101101101110011010001011… |
… | …100111000101101010100111 |
3 | 222101001002121102210010211201 |
4 | 231232122023213011222213 |
5 | 202324320431024410114 |
6 | 1551412355020143331 |
7 | 60234042465422401 |
oct | 5556321347055247 |
9 | 871032542703751 |
10 | 201101301013159 |
11 | 590936457a3828 |
12 | 1a67a942997b47 |
13 | 8829a04768311 |
14 | 37934d7bd3b71 |
15 | 183b18dd80874 |
hex | b6e68b9c5aa7 |
201101301013159 has 2 divisors, whose sum is σ = 201101301013160. Its totient is φ = 201101301013158.
The previous prime is 201101301013153. The next prime is 201101301013183. The reversal of 201101301013159 is 951310103101102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201101301013159 - 217 = 201101300882087 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201101301013153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550650506579 + 100550650506580.
It is an arithmetic number, because the mean of its divisors is an integer number (100550650506580).
Almost surely, 2201101301013159 is an apocalyptic number.
201101301013159 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101301013159 is an equidigital number, since it uses as much as digits as its factorization.
201101301013159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 28.
The spelling of 201101301013159 in words is "two hundred one trillion, one hundred one billion, three hundred one million, thirteen thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •