Base | Representation |
---|---|
bin | 11011111101010101… |
… | …101000101101110100 |
3 | 2212111011010122210010 |
4 | 123331111220231310 |
5 | 442440122024340 |
6 | 21442511100220 |
7 | 2111632510101 |
oct | 337525505564 |
9 | 85434118703 |
10 | 30020111220 |
11 | 1180562a980 |
12 | 5999811670 |
13 | 2aa55b7028 |
14 | 164ada1aa8 |
15 | baa79cb80 |
hex | 6fd568b74 |
30020111220 has 48 divisors (see below), whose sum is σ = 91697796288. Its totient is φ = 7277602560.
The previous prime is 30020111201. The next prime is 30020111291. The reversal of 30020111220 is 2211102003.
It is a super-2 number, since 2×300201112202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 30020111196 and 30020111205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22741849 + ... + 22743168.
It is an arithmetic number, because the mean of its divisors is an integer number (1910370756).
Almost surely, 230020111220 is an apocalyptic number.
30020111220 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30020111220 is an abundant number, since it is smaller than the sum of its proper divisors (61677685068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30020111220 is a wasteful number, since it uses less digits than its factorization.
30020111220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45485040 (or 45485038 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 30020111220 its reverse (2211102003), we get a palindrome (32231213223).
The spelling of 30020111220 in words is "thirty billion, twenty million, one hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •