Base | Representation |
---|---|
bin | 1101101100010110001000… |
… | …01000100011100101101110 |
3 | 10221121120210011002020010210 |
4 | 12312023010020203211232 |
5 | 12421314322344302342 |
6 | 144012450241043250 |
7 | 6225306634145025 |
oct | 666130410434556 |
9 | 127546704066123 |
10 | 30111011322222 |
11 | 965a00a998556 |
12 | 3463870926526 |
13 | 13a55c130b96c |
14 | 7615489c78bc |
15 | 3733caa8c79c |
hex | 1b62c422396e |
30111011322222 has 24 divisors (see below), whose sum is σ = 62954212714344. Its totient is φ = 9600612304624.
The previous prime is 30111011322211. The next prime is 30111011322233. The reversal of 30111011322222 is 22222311011103.
It is an interprime number because it is at equal distance from previous prime (30111011322211) and next prime (30111011322233).
It is a super-2 number, since 2×301110113222222 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4743382353 + ... + 4743388700.
It is an arithmetic number, because the mean of its divisors is an integer number (2623092196431).
Almost surely, 230111011322222 is an apocalyptic number.
30111011322222 is an abundant number, since it is smaller than the sum of its proper divisors (32843201392122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30111011322222 is a wasteful number, since it uses less digits than its factorization.
30111011322222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9486771104 (or 9486771081 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 30111011322222 its reverse (22222311011103), we get a palindrome (52333322333325).
The spelling of 30111011322222 in words is "thirty trillion, one hundred eleven billion, eleven million, three hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •