Base | Representation |
---|---|
bin | 11100000010110001… |
… | …001100100011110000 |
3 | 2212201111120120021110 |
4 | 130002301030203300 |
5 | 443131433101000 |
6 | 21455523553320 |
7 | 2114120110146 |
oct | 340261144360 |
9 | 85644516243 |
10 | 30111222000 |
11 | 11851aaa842 |
12 | 5a0422b840 |
13 | 2abb437732 |
14 | 165911b596 |
15 | bb3798850 |
hex | 702c4c8f0 |
30111222000 has 160 divisors (see below), whose sum is σ = 100426697280. Its totient is φ = 7752729600.
The previous prime is 30111221999. The next prime is 30111222013. The reversal of 30111222000 is 22211103.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87474 + ... + 260526.
It is an arithmetic number, because the mean of its divisors is an integer number (627666858).
Almost surely, 230111222000 is an apocalyptic number.
30111222000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30111222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50213348640).
30111222000 is an abundant number, since it is smaller than the sum of its proper divisors (70315475280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30111222000 is a wasteful number, since it uses less digits than its factorization.
30111222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173108 (or 173092 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 30111222000 its reverse (22211103), we get a palindrome (30133433103).
The spelling of 30111222000 in words is "thirty billion, one hundred eleven million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •