Base | Representation |
---|---|
bin | 1101101100000101100001… |
… | …11111011100000000110101 |
3 | 10221120201210010021211221102 |
4 | 12312002300333130000311 |
5 | 12421143100124331242 |
6 | 144004414113255445 |
7 | 6224543051130632 |
oct | 666026077340065 |
9 | 127521703254842 |
10 | 30102100230197 |
11 | 9656257902196 |
12 | 3461ba4564585 |
13 | 13a48010ba548 |
14 | 760d41317189 |
15 | 3730585c3e32 |
hex | 1b60b0fdc035 |
30102100230197 has 2 divisors, whose sum is σ = 30102100230198. Its totient is φ = 30102100230196.
The previous prime is 30102100230053. The next prime is 30102100230203. The reversal of 30102100230197 is 79103200120103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27684529268881 + 2417570961316 = 5261609^2 + 1554854^2 .
It is an emirp because it is prime and its reverse (79103200120103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30102100230197 - 28 = 30102100229941 is a prime.
It is a super-2 number, since 2×301021002301972 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30102100233197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051050115098 + 15051050115099.
It is an arithmetic number, because the mean of its divisors is an integer number (15051050115099).
Almost surely, 230102100230197 is an apocalyptic number.
It is an amenable number.
30102100230197 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102100230197 is an equidigital number, since it uses as much as digits as its factorization.
30102100230197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 29.
The spelling of 30102100230197 in words is "thirty trillion, one hundred two billion, one hundred million, two hundred thirty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •