Base | Representation |
---|---|
bin | 1101101111100011000001… |
… | …01111101010101111010101 |
3 | 10222000002201100122121102002 |
4 | 12313301200233222233111 |
5 | 12430120113312100341 |
6 | 144135201450525045 |
7 | 6236252606046245 |
oct | 667614057525725 |
9 | 128002640577362 |
10 | 30221013003221 |
11 | 96a1728a86617 |
12 | 3481050136785 |
13 | 13b2aa1c76a31 |
14 | 7669c20c7b25 |
15 | 3761b7db829b |
hex | 1b7c60beabd5 |
30221013003221 has 2 divisors, whose sum is σ = 30221013003222. Its totient is φ = 30221013003220.
The previous prime is 30221013003211. The next prime is 30221013003239. The reversal of 30221013003221 is 12230031012203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19354852342225 + 10866160660996 = 4399415^2 + 3296386^2 .
It is a cyclic number.
It is not a de Polignac number, because 30221013003221 - 238 = 29946135096277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30221013003193 and 30221013003202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30221013003211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110506501610 + 15110506501611.
It is an arithmetic number, because the mean of its divisors is an integer number (15110506501611).
Almost surely, 230221013003221 is an apocalyptic number.
It is an amenable number.
30221013003221 is a deficient number, since it is larger than the sum of its proper divisors (1).
30221013003221 is an equidigital number, since it uses as much as digits as its factorization.
30221013003221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30221013003221 its reverse (12230031012203), we get a palindrome (42451044015424).
The spelling of 30221013003221 in words is "thirty trillion, two hundred twenty-one billion, thirteen million, three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •