Base | Representation |
---|---|
bin | 10110101111001100011100… |
… | …100001111001100010101101 |
3 | 111010001221000000210102021022 |
4 | 112233030130201321202231 |
5 | 101101400403230420021 |
6 | 552403243024343525 |
7 | 30030530142625265 |
oct | 2657143441714255 |
9 | 433057000712238 |
10 | 100000202201261 |
11 | 29954936162a5a |
12 | b270861474ba5 |
13 | 43a4c94cc116b |
14 | 1a9a06da087a5 |
15 | b8637c4111ab |
hex | 5af31c8798ad |
100000202201261 has 2 divisors, whose sum is σ = 100000202201262. Its totient is φ = 100000202201260.
The previous prime is 100000202201219. The next prime is 100000202201363. The reversal of 100000202201261 is 162102202000001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99572657532100 + 427544669161 = 9978610^2 + 653869^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000202201261 - 26 = 100000202201197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100000202203261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000101100630 + 50000101100631.
It is an arithmetic number, because the mean of its divisors is an integer number (50000101100631).
Almost surely, 2100000202201261 is an apocalyptic number.
It is an amenable number.
100000202201261 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000202201261 is an equidigital number, since it uses as much as digits as its factorization.
100000202201261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 100000202201261 its reverse (162102202000001), we get a palindrome (262102404201262).
The spelling of 100000202201261 in words is "one hundred trillion, two hundred two million, two hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •