Base | Representation |
---|---|
bin | 10110110010000111101001… |
… | …000011010100011110010001 |
3 | 111010210010211001101122112001 |
4 | 112302013221003110132101 |
5 | 101113144030203310001 |
6 | 553035444032034001 |
7 | 30051204124045501 |
oct | 2662075103243621 |
9 | 433703731348461 |
10 | 100201202010001 |
11 | 29a22100327274 |
12 | b2a37b7992901 |
13 | 43bac184b1431 |
14 | 1aa5a9a7c7a01 |
15 | b8b6e352a001 |
hex | 5b21e90d4791 |
100201202010001 has 2 divisors, whose sum is σ = 100201202010002. Its totient is φ = 100201202010000.
The previous prime is 100201202009941. The next prime is 100201202010101. The reversal of 100201202010001 is 100010202102001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59059240370001 + 41141961640000 = 7685001^2 + 6414200^2 .
It is a cyclic number.
It is not a de Polignac number, because 100201202010001 - 237 = 100063763056529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100201202010001.
It is not a weakly prime, because it can be changed into another prime (100201202010101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100601005000 + 50100601005001.
It is an arithmetic number, because the mean of its divisors is an integer number (50100601005001).
Almost surely, 2100201202010001 is an apocalyptic number.
It is an amenable number.
100201202010001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100201202010001 is an equidigital number, since it uses as much as digits as its factorization.
100201202010001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100201202010001 its reverse (100010202102001), we get a palindrome (200211404112002).
The spelling of 100201202010001 in words is "one hundred trillion, two hundred one billion, two hundred two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •