Base | Representation |
---|---|
bin | 1101101100011000001101… |
… | …10111110010111010010000 |
3 | 10221121200200011221212001012 |
4 | 12312030012313302322100 |
5 | 12421324121014031000 |
6 | 144013153315430052 |
7 | 6225346451234405 |
oct | 666140667627220 |
9 | 127550604855035 |
10 | 30112131002000 |
11 | 965a534a24543 |
12 | 3463b238b5328 |
13 | 13a573c290088 |
14 | 7616135aa2ac |
15 | 37344400e735 |
hex | 1b6306df2e90 |
30112131002000 has 80 divisors (see below), whose sum is σ = 72888843950832. Its totient is φ = 12031996953600.
The previous prime is 30112131001993. The next prime is 30112131002003. The reversal of 30112131002000 is 20013121103.
It can be written as a sum of positive squares in 8 ways, for example, as 26897583218944 + 3214547783056 = 5186288^2 + 1792916^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (30112131002003) 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 15 ways as a sum of consecutive naturals, for example, 6160187 + ... + 9908186.
Almost surely, 230112131002000 is an apocalyptic number.
It is an amenable number.
30112131002000 is an abundant number, since it is smaller than the sum of its proper divisors (42776712948832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30112131002000 is a wasteful number, since it uses less digits than its factorization.
30112131002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16069333 (or 16069317 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 30112131002000 its reverse (20013121103), we get a palindrome (30132144123103).
The spelling of 30112131002000 in words is "thirty trillion, one hundred twelve billion, one hundred thirty-one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •