Base | Representation |
---|---|
bin | 1101111010100100111100… |
… | …01100100001110011101101 |
3 | 11000100022221200121202022111 |
4 | 12331102132030201303231 |
5 | 13002322300240213122 |
6 | 145025240233044021 |
7 | 6305530360531234 |
oct | 675223614416355 |
9 | 130308850552274 |
10 | 30600001101037 |
11 | 98284299768a5 |
12 | 352259a556611 |
13 | 140c74c393954 |
14 | 77b095839b1b |
15 | 380e99cb2d77 |
hex | 1bd49e321ced |
30600001101037 has 2 divisors, whose sum is σ = 30600001101038. Its totient is φ = 30600001101036.
The previous prime is 30600001100969. The next prime is 30600001101053. The reversal of 30600001101037 is 73010110000603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25329367743241 + 5270633357796 = 5032829^2 + 2295786^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30600001101037 is a prime.
It is a super-2 number, since 2×306000011010372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30600001100999 and 30600001101017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30600001101437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15300000550518 + 15300000550519.
It is an arithmetic number, because the mean of its divisors is an integer number (15300000550519).
Almost surely, 230600001101037 is an apocalyptic number.
It is an amenable number.
30600001101037 is a deficient number, since it is larger than the sum of its proper divisors (1).
30600001101037 is an equidigital number, since it uses as much as digits as its factorization.
30600001101037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 22.
The spelling of 30600001101037 in words is "thirty trillion, six hundred billion, one million, one hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •