Base | Representation |
---|---|
bin | 1101101001011111111111… |
… | …00000100001000000010101 |
3 | 10221021020101010111110220202 |
4 | 12310233333200201000111 |
5 | 12413214040120223104 |
6 | 143455515010310245 |
7 | 6215245436002652 |
oct | 664577740410025 |
9 | 127236333443822 |
10 | 30013223211029 |
11 | 962159a072233 |
12 | 344891b888385 |
13 | 1399308b34086 |
14 | 75a90d61ac29 |
15 | 370aa5b1c51e |
hex | 1b4bff821015 |
30013223211029 has 2 divisors, whose sum is σ = 30013223211030. Its totient is φ = 30013223211028.
The previous prime is 30013223211017. The next prime is 30013223211031. The reversal of 30013223211029 is 92011232231003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26652593638225 + 3360629572804 = 5162615^2 + 1833202^2 .
It is a cyclic number.
It is not a de Polignac number, because 30013223211029 - 244 = 12421037166613 is a prime.
Together with 30013223211031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 30013223210992 and 30013223211010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30013223211089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15006611605514 + 15006611605515.
It is an arithmetic number, because the mean of its divisors is an integer number (15006611605515).
Almost surely, 230013223211029 is an apocalyptic number.
It is an amenable number.
30013223211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
30013223211029 is an equidigital number, since it uses as much as digits as its factorization.
30013223211029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 30013223211029 in words is "thirty trillion, thirteen billion, two hundred twenty-three million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •