Base | Representation |
---|---|
bin | 1101101100111001100000… |
… | …01001010001110100111110 |
3 | 10221200101210201212200110120 |
4 | 12312130300021101310332 |
5 | 12422122221322221001 |
6 | 144025311001315410 |
7 | 6226551366362223 |
oct | 666346011216476 |
9 | 127611721780416 |
10 | 30130003320126 |
11 | 9667076428696 |
12 | 3467491195b66 |
13 | 13a7329c07048 |
14 | 76242b07b94a |
15 | 373b3d096236 |
hex | 1b6730251d3e |
30130003320126 has 64 divisors (see below), whose sum is σ = 64218235553280. Its totient is φ = 9391442780160.
The previous prime is 30130003320107. The next prime is 30130003320127. The reversal of 30130003320126 is 62102330003103.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 30130003320096 and 30130003320105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30130003320127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11205055 + ... + 13631333.
It is an arithmetic number, because the mean of its divisors is an integer number (1003409930520).
Almost surely, 230130003320126 is an apocalyptic number.
30130003320126 is an abundant number, since it is smaller than the sum of its proper divisors (34088232233154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30130003320126 is a wasteful number, since it uses less digits than its factorization.
30130003320126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2427089.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 30130003320126 its reverse (62102330003103), we get a palindrome (92232333323229).
The spelling of 30130003320126 in words is "thirty trillion, one hundred thirty billion, three million, three hundred twenty thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •