Base | Representation |
---|---|
bin | 1101101100010100010011… |
… | …10010010110110011001001 |
3 | 10221121111020221010001102011 |
4 | 12312022021302112303021 |
5 | 12421310321300033022 |
6 | 144012205151535521 |
7 | 6225243446512531 |
oct | 666121162266311 |
9 | 127544227101364 |
10 | 30110032424137 |
11 | 9659658377976 |
12 | 3463638b2a5a1 |
13 | 13a549657c623 |
14 | 7614949b04c1 |
15 | 37336eb78977 |
hex | 1b6289c96cc9 |
30110032424137 has 2 divisors, whose sum is σ = 30110032424138. Its totient is φ = 30110032424136.
The previous prime is 30110032424093. The next prime is 30110032424149. The reversal of 30110032424137 is 73142423001103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29919324660736 + 190707763401 = 5469856^2 + 436701^2 .
It is a cyclic number.
It is not a de Polignac number, because 30110032424137 - 223 = 30110024035529 is a prime.
It is a super-2 number, since 2×301100324241372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30110032424099 and 30110032424108.
It is not a weakly prime, because it can be changed into another prime (30114032424137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15055016212068 + 15055016212069.
It is an arithmetic number, because the mean of its divisors is an integer number (15055016212069).
Almost surely, 230110032424137 is an apocalyptic number.
It is an amenable number.
30110032424137 is a deficient number, since it is larger than the sum of its proper divisors (1).
30110032424137 is an equidigital number, since it uses as much as digits as its factorization.
30110032424137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12096, while the sum is 31.
The spelling of 30110032424137 in words is "thirty trillion, one hundred ten billion, thirty-two million, four hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •