Base | Representation |
---|---|
bin | 1101101001110010011010… |
… | …11010101001011011101001 |
3 | 10221022011220212111010210102 |
4 | 12310321031122221123221 |
5 | 12413344322234330441 |
6 | 143504233033555145 |
7 | 6216045623166014 |
oct | 664711532513351 |
9 | 127264825433712 |
10 | 30023120230121 |
11 | 962580873a157 |
12 | 344a822275ab5 |
13 | 139a2253a5ca5 |
14 | 75b1abc1437b |
15 | 370e8493769b |
hex | 1b4e4d6a96e9 |
30023120230121 has 2 divisors, whose sum is σ = 30023120230122. Its totient is φ = 30023120230120.
The previous prime is 30023120230087. The next prime is 30023120230127. The reversal of 30023120230121 is 12103202132003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22571421381721 + 7451698848400 = 4750939^2 + 2729780^2 .
It is a cyclic number.
It is not a de Polignac number, because 30023120230121 - 230 = 30022046488297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30023120230093 and 30023120230102.
It is not a weakly prime, because it can be changed into another prime (30023120230127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15011560115060 + 15011560115061.
It is an arithmetic number, because the mean of its divisors is an integer number (15011560115061).
Almost surely, 230023120230121 is an apocalyptic number.
It is an amenable number.
30023120230121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30023120230121 is an equidigital number, since it uses as much as digits as its factorization.
30023120230121 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 30023120230121 its reverse (12103202132003), we get a palindrome (42126322362124).
The spelling of 30023120230121 in words is "thirty trillion, twenty-three billion, one hundred twenty million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •