Base | Representation |
---|---|
bin | 1101101100000101011001… |
… | …11111011001110010001001 |
3 | 10221120201121102222220100201 |
4 | 12312002230333121302021 |
5 | 12421142430434042301 |
6 | 144004403314532201 |
7 | 6224541304466431 |
oct | 666025477316211 |
9 | 127521542886321 |
10 | 30102033112201 |
11 | 9656222a2a476 |
12 | 3461b85b97061 |
13 | 13a47c021a75b |
14 | 760d364452c1 |
15 | 373052767201 |
hex | 1b60acfd9c89 |
30102033112201 has 2 divisors, whose sum is σ = 30102033112202. Its totient is φ = 30102033112200.
The previous prime is 30102033112189. The next prime is 30102033112253. The reversal of 30102033112201 is 10221133020103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24326547518025 + 5775485594176 = 4932195^2 + 2403224^2 .
It is a cyclic number.
It is not a de Polignac number, because 30102033112201 - 223 = 30102024723593 is a prime.
It is a super-2 number, since 2×301020331122012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30102033112271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051016556100 + 15051016556101.
It is an arithmetic number, because the mean of its divisors is an integer number (15051016556101).
Almost surely, 230102033112201 is an apocalyptic number.
It is an amenable number.
30102033112201 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102033112201 is an equidigital number, since it uses as much as digits as its factorization.
30102033112201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30102033112201 its reverse (10221133020103), we get a palindrome (40323166132304).
The spelling of 30102033112201 in words is "thirty trillion, one hundred two billion, thirty-three million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •