Base | Representation |
---|---|
bin | 1101101001001101001001… |
… | …10001111111110000111110 |
3 | 10221020021021101211122120110 |
4 | 12310212210301333300332 |
5 | 12413032332422212342 |
6 | 143451123341330450 |
7 | 6214440030520434 |
oct | 664464461776076 |
9 | 127207241748513 |
10 | 30003111132222 |
11 | 9618280066808 |
12 | 3446979266a26 |
13 | 1398386b642a7 |
14 | 75a230640d54 |
15 | 3706b2ec0c9c |
hex | 1b49a4c7fc3e |
30003111132222 has 8 divisors (see below), whose sum is σ = 60006222264456. Its totient is φ = 10001037044072.
The previous prime is 30003111132173. The next prime is 30003111132223. The reversal of 30003111132222 is 22223111130003.
It is a sphenic number, since it is the product of 3 distinct primes.
30003111132222 is an admirable number.
It is a super-2 number, since 2×300031111322222 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003111132223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2500259261013 + ... + 2500259261024.
It is an arithmetic number, because the mean of its divisors is an integer number (7500777783057).
Almost surely, 230003111132222 is an apocalyptic number.
30003111132222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30003111132222 is a wasteful number, since it uses less digits than its factorization.
30003111132222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5000518522042.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30003111132222 its reverse (22223111130003), we get a palindrome (52226222262225).
The spelling of 30003111132222 in words is "thirty trillion, three billion, one hundred eleven million, one hundred thirty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •