Base | Representation |
---|---|
bin | 11100000010001000… |
… | …000010000010111101 |
3 | 2212200202021022212011 |
4 | 130002020002002331 |
5 | 443121202243122 |
6 | 21454500411221 |
7 | 2113626304465 |
oct | 340210020275 |
9 | 85622238764 |
10 | 30100431037 |
11 | 118469aa396 |
12 | 5a006a6b11 |
13 | 2ab9129b51 |
14 | 165790cba5 |
15 | bb2866377 |
hex | 7022020bd |
30100431037 has 2 divisors, whose sum is σ = 30100431038. Its totient is φ = 30100431036.
The previous prime is 30100430929. The next prime is 30100431059. The reversal of 30100431037 is 73013400103.
It is a happy number.
It is an a-pointer prime, because the next prime (30100431059) can be obtained adding 30100431037 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24175896196 + 5924534841 = 155486^2 + 76971^2 .
It is a cyclic number.
It is not a de Polignac number, because 30100431037 - 215 = 30100398269 is a prime.
It is a super-2 number, since 2×301004310372 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30100430999 and 30100431017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30100431437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15050215518 + 15050215519.
It is an arithmetic number, because the mean of its divisors is an integer number (15050215519).
Almost surely, 230100431037 is an apocalyptic number.
It is an amenable number.
30100431037 is a deficient number, since it is larger than the sum of its proper divisors (1).
30100431037 is an equidigital number, since it uses as much as digits as its factorization.
30100431037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 22.
The spelling of 30100431037 in words is "thirty billion, one hundred million, four hundred thirty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •