Base | Representation |
---|---|
bin | 101101110000000000011100… |
… | …001000111110111110000001 |
3 | 222101102121000111221121011202 |
4 | 231300000130020332332001 |
5 | 202333120313100001004 |
6 | 1551535034145350545 |
7 | 60245010426416132 |
oct | 5560003410767601 |
9 | 871377014847152 |
10 | 201211100000129 |
11 | 5912616a42986a |
12 | 1a698086338455 |
13 | 8837182414aab |
14 | 379895240dc89 |
15 | 183de684bdb1e |
hex | b7001c23ef81 |
201211100000129 has 2 divisors, whose sum is σ = 201211100000130. Its totient is φ = 201211100000128.
The previous prime is 201211100000077. The next prime is 201211100000137. The reversal of 201211100000129 is 921000001112102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 176909897359504 + 24301202640625 = 13300748^2 + 4929625^2 .
It is a cyclic number.
It is not a de Polignac number, because 201211100000129 - 224 = 201211083222913 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 201211100000129.
It is not a weakly prime, because it can be changed into another prime (201211100000189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605550000064 + 100605550000065.
It is an arithmetic number, because the mean of its divisors is an integer number (100605550000065).
Almost surely, 2201211100000129 is an apocalyptic number.
It is an amenable number.
201211100000129 is a deficient number, since it is larger than the sum of its proper divisors (1).
201211100000129 is an equidigital number, since it uses as much as digits as its factorization.
201211100000129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 201211100000129 in words is "two hundred one trillion, two hundred eleven billion, one hundred million, one hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •