Base | Representation |
---|---|
bin | 1101101001101100110110… |
… | …10000000010000100101110 |
3 | 10221021220012112220202021100 |
4 | 12310312123100002010232 |
5 | 12413322212030244042 |
6 | 143503020254343530 |
7 | 6215611556056524 |
oct | 664663320020456 |
9 | 127256175822240 |
10 | 30020131103022 |
11 | 9624514425785 |
12 | 344a1291baba6 |
13 | 1399b6a02a728 |
14 | 75ada6c3c314 |
15 | 370d5c2e024c |
hex | 1b4d9b40212e |
30020131103022 has 48 divisors (see below), whose sum is σ = 65844387619920. Its totient is φ = 9883987872000.
The previous prime is 30020131103003. The next prime is 30020131103071. The reversal of 30020131103022 is 22030113102003.
30020131103022 is a `hidden beast` number, since 30 + 0 + 20 + 1 + 311 + 0 + 302 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 30020131102986 and 30020131103004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18943179 + ... + 20466662.
It is an arithmetic number, because the mean of its divisors is an integer number (1371758075415).
Almost surely, 230020131103022 is an apocalyptic number.
30020131103022 is an abundant number, since it is smaller than the sum of its proper divisors (35824256516898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30020131103022 is a wasteful number, since it uses less digits than its factorization.
30020131103022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39410369 (or 39410366 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30020131103022 its reverse (22030113102003), we get a palindrome (52050244205025).
The spelling of 30020131103022 in words is "thirty trillion, twenty billion, one hundred thirty-one million, one hundred three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •