Base | Representation |
---|---|
bin | 1101101111100001101100… |
… | …11000101011010010101101 |
3 | 10222000000212211101211021112 |
4 | 12313300312120223102231 |
5 | 12430112134344124401 |
6 | 144135003142441405 |
7 | 6236226156334556 |
oct | 667606630532255 |
9 | 128000784354245 |
10 | 30220302333101 |
11 | 96a13a3909641 |
12 | 3480a92133265 |
13 | 13b29ba96ca7a |
14 | 76695597332d |
15 | 3761757d93bb |
hex | 1b7c3662b4ad |
30220302333101 has 2 divisors, whose sum is σ = 30220302333102. Its totient is φ = 30220302333100.
The previous prime is 30220302333049. The next prime is 30220302333103. The reversal of 30220302333101 is 10133320302203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30158164806025 + 62137527076 = 5491645^2 + 249274^2 .
It is a cyclic number.
It is not a de Polignac number, because 30220302333101 - 26 = 30220302333037 is a prime.
Together with 30220302333103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30220302333103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110151166550 + 15110151166551.
It is an arithmetic number, because the mean of its divisors is an integer number (15110151166551).
Almost surely, 230220302333101 is an apocalyptic number.
It is an amenable number.
30220302333101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30220302333101 is an equidigital number, since it uses as much as digits as its factorization.
30220302333101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30220302333101 its reverse (10133320302203), we get a palindrome (40353622635304).
The spelling of 30220302333101 in words is "thirty trillion, two hundred twenty billion, three hundred two million, three hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •