Base | Representation |
---|---|
bin | 100010010110000100010100… |
… | …1001001110111110111000001 |
3 | 1110121122111011101211101220002 |
4 | 1010230020221021313313001 |
5 | 304044102001112320001 |
6 | 2550302511534125345 |
7 | 120430004051115521 |
oct | 10454105111676701 |
9 | 1417574141741802 |
10 | 302100100120001 |
11 | 88292a2986a007 |
12 | 29a71034350855 |
13 | cc74bc0131c11 |
14 | 5485a19769681 |
15 | 24dd4b475146b |
hex | 112c229277dc1 |
302100100120001 has 2 divisors, whose sum is σ = 302100100120002. Its totient is φ = 302100100120000.
The previous prime is 302100100119977. The next prime is 302100100120037. The reversal of 302100100120001 is 100021001001203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 301301865086401 + 798235033600 = 17358049^2 + 893440^2 .
It is an emirp because it is prime and its reverse (100021001001203) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302100100120001 is a prime.
It is not a weakly prime, because it can be changed into another prime (302100100120061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151050050060000 + 151050050060001.
It is an arithmetic number, because the mean of its divisors is an integer number (151050050060001).
Almost surely, 2302100100120001 is an apocalyptic number.
It is an amenable number.
302100100120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
302100100120001 is an equidigital number, since it uses as much as digits as its factorization.
302100100120001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 302100100120001 its reverse (100021001001203), we get a palindrome (402121101121204).
The spelling of 302100100120001 in words is "three hundred two trillion, one hundred billion, one hundred million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •