Base | Representation |
---|---|
bin | 1101101001100000001011… |
… | …11100100011000111100101 |
3 | 10221021020122122202001111121 |
4 | 12310300011330203013211 |
5 | 12413214300243114023 |
6 | 143455533425333541 |
7 | 6215251220044465 |
oct | 664600574430745 |
9 | 127236578661447 |
10 | 30013331223013 |
11 | 9621645036236 |
12 | 344894ba972b1 |
13 | 13993253215a8 |
14 | 75a91dad5ba5 |
15 | 370ab0355d5d |
hex | 1b4c05f231e5 |
30013331223013 has 2 divisors, whose sum is σ = 30013331223014. Its totient is φ = 30013331223012.
The previous prime is 30013331222983. The next prime is 30013331223023. The reversal of 30013331223013 is 31032213331003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18951900010884 + 11061431212129 = 4353378^2 + 3325873^2 .
It is a cyclic number.
It is not a de Polignac number, because 30013331223013 - 237 = 29875892269541 is a prime.
It is a super-2 number, since 2×300133312230132 (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 (30013331223023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15006665611506 + 15006665611507.
It is an arithmetic number, because the mean of its divisors is an integer number (15006665611507).
Almost surely, 230013331223013 is an apocalyptic number.
It is an amenable number.
30013331223013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30013331223013 is an equidigital number, since it uses as much as digits as its factorization.
30013331223013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 30013331223013 its reverse (31032213331003), we get a palindrome (61045544554016).
The spelling of 30013331223013 in words is "thirty trillion, thirteen billion, three hundred thirty-one million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •