Base | Representation |
---|---|
bin | 1101101100101010110010… |
… | …01100100100001110000001 |
3 | 10221122122102002100210010021 |
4 | 12312111121030210032001 |
5 | 12422010031120110103 |
6 | 144021522551133441 |
7 | 6226151525256331 |
oct | 666253114441601 |
9 | 127578362323107 |
10 | 30122102113153 |
11 | 96637913a7976 |
12 | 3465a47074281 |
13 | 13a666aca424b |
14 | 761cbb96d0c1 |
15 | 3738295b2bbd |
hex | 1b6559324381 |
30122102113153 has 2 divisors, whose sum is σ = 30122102113154. Its totient is φ = 30122102113152.
The previous prime is 30122102113123. The next prime is 30122102113253. The reversal of 30122102113153 is 35131120122103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29942433793024 + 179668320129 = 5471968^2 + 423873^2 .
It is an emirp because it is prime and its reverse (35131120122103) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30122102113153 is a prime.
It is not a weakly prime, because it can be changed into another prime (30122102113123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15061051056576 + 15061051056577.
It is an arithmetic number, because the mean of its divisors is an integer number (15061051056577).
Almost surely, 230122102113153 is an apocalyptic number.
It is an amenable number.
30122102113153 is a deficient number, since it is larger than the sum of its proper divisors (1).
30122102113153 is an equidigital number, since it uses as much as digits as its factorization.
30122102113153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 30122102113153 its reverse (35131120122103), we get a palindrome (65253222235256).
The spelling of 30122102113153 in words is "thirty trillion, one hundred twenty-two billion, one hundred two million, one hundred thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •