Base | Representation |
---|---|
bin | 1101101001101110101011… |
… | …01010100000110001000101 |
3 | 10221021222201211222220222001 |
4 | 12310313111222200301011 |
5 | 12413331213421414023 |
6 | 143503301423505301 |
7 | 6215645056103623 |
oct | 664672552406105 |
9 | 127258654886861 |
10 | 30021111123013 |
11 | 962497764225a |
12 | 344a361458231 |
13 | 1399c9509060a |
14 | 75b05b068513 |
15 | 370db83766ad |
hex | 1b4dd5aa0c45 |
30021111123013 has 2 divisors, whose sum is σ = 30021111123014. Its totient is φ = 30021111123012.
The previous prime is 30021111122987. The next prime is 30021111123019. The reversal of 30021111123013 is 31032111112003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17543381464324 + 12477729658689 = 4188482^2 + 3532383^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30021111123013 is a prime.
It is a super-2 number, since 2×300211111230132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30021111123019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15010555561506 + 15010555561507.
It is an arithmetic number, because the mean of its divisors is an integer number (15010555561507).
Almost surely, 230021111123013 is an apocalyptic number.
It is an amenable number.
30021111123013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30021111123013 is an equidigital number, since it uses as much as digits as its factorization.
30021111123013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 30021111123013 its reverse (31032111112003), we get a palindrome (61053222235016).
The spelling of 30021111123013 in words is "thirty trillion, twenty-one billion, one hundred eleven million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •