Base | Representation |
---|---|
bin | 1101101111100001100100… |
… | …00101001101011010101001 |
3 | 10222000000200210112002002001 |
4 | 12313300302011031122221 |
5 | 12430112012402334004 |
6 | 144134552043011001 |
7 | 6236224321466206 |
oct | 667606205153251 |
9 | 128000623462061 |
10 | 30220230121129 |
11 | 96a1367077724 |
12 | 3480a71b09a61 |
13 | 13b29a8a084a9 |
14 | 76694a136cad |
15 | 37616e2c31a4 |
hex | 1b7c3214d6a9 |
30220230121129 has 2 divisors, whose sum is σ = 30220230121130. Its totient is φ = 30220230121128.
The previous prime is 30220230121093. The next prime is 30220230121183. The reversal of 30220230121129 is 92112103202203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26966968578729 + 3253261542400 = 5192973^2 + 1803680^2 .
It is a cyclic number.
It is not a de Polignac number, because 30220230121129 - 217 = 30220229990057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30220230121097 and 30220230121106.
It is not a weakly prime, because it can be changed into another prime (30220230181129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110115060564 + 15110115060565.
It is an arithmetic number, because the mean of its divisors is an integer number (15110115060565).
Almost surely, 230220230121129 is an apocalyptic number.
It is an amenable number.
30220230121129 is a deficient number, since it is larger than the sum of its proper divisors (1).
30220230121129 is an equidigital number, since it uses as much as digits as its factorization.
30220230121129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 30220230121129 in words is "thirty trillion, two hundred twenty billion, two hundred thirty million, one hundred twenty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •