Base | Representation |
---|---|
bin | 1101101111100001001100… |
… | …10101101011100001000010 |
3 | 10222000000012001210222112110 |
4 | 12313300212111223201002 |
5 | 12430111111434042010 |
6 | 144134520324240150 |
7 | 6236216410110021 |
oct | 667604625534102 |
9 | 128000161728473 |
10 | 30220033112130 |
11 | 96a1275947974 |
12 | 3480a17b40056 |
13 | 13b2976c5a714 |
14 | 76692bcd28b8 |
15 | 37615bd5a120 |
hex | 1b7c2656b842 |
30220033112130 has 32 divisors (see below), whose sum is σ = 72528233897664. Its totient is φ = 8058658337856.
The previous prime is 30220033112111. The next prime is 30220033112153. The reversal of 30220033112130 is 3121133002203.
It is a super-2 number, since 2×302200331121302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30220033112097 and 30220033112106.
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, 20112789 + ... + 21563031.
It is an arithmetic number, because the mean of its divisors is an integer number (2266507309302).
Almost surely, 230220033112130 is an apocalyptic number.
30220033112130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30220033112130 is an abundant number, since it is smaller than the sum of its proper divisors (42308200785534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30220033112130 is a wasteful number, since it uses less digits than its factorization.
30220033112130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2144850.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30220033112130 its reverse (3121133002203), we get a palindrome (33341166114333).
The spelling of 30220033112130 in words is "thirty trillion, two hundred twenty billion, thirty-three million, one hundred twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •