Base | Representation |
---|---|
bin | 11110100011111101101… |
… | …111000000110101101101 |
3 | 21102202222121201001210101 |
4 | 132203331233000311231 |
5 | 233402202424002201 |
6 | 4244452524111101 |
7 | 304506636645205 |
oct | 36437557006555 |
9 | 7382877631711 |
10 | 2100201000301 |
11 | 73a765792438 |
12 | 29b049095491 |
13 | 1230818bb4b1 |
14 | 739164b3405 |
15 | 3996ebbcd01 |
hex | 1e8fdbc0d6d |
2100201000301 has 2 divisors, whose sum is σ = 2100201000302. Its totient is φ = 2100201000300.
The previous prime is 2100201000283. The next prime is 2100201000311. The reversal of 2100201000301 is 1030001020012.
It is an a-pointer prime, because the next prime (2100201000311) can be obtained adding 2100201000301 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1713284655625 + 386916344676 = 1308925^2 + 622026^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100201000301 - 211 = 2100200998253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100201000311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050100500150 + 1050100500151.
It is an arithmetic number, because the mean of its divisors is an integer number (1050100500151).
Almost surely, 22100201000301 is an apocalyptic number.
It is an amenable number.
2100201000301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100201000301 is an equidigital number, since it uses as much as digits as its factorization.
2100201000301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 2100201000301 its reverse (1030001020012), we get a palindrome (3130202020313).
The spelling of 2100201000301 in words is "two trillion, one hundred billion, two hundred one million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •