Base | Representation |
---|---|
bin | 1010111011101110001000… |
… | …1100000010110000001110 |
3 | 1120120012121001110222022201 |
4 | 2232323202030002300032 |
5 | 3033423220001131110 |
6 | 41322231225232114 |
7 | 2350332252063640 |
oct | 256734214026016 |
9 | 46505531428281 |
10 | 12021113302030 |
11 | 3915142084148 |
12 | 142193263263a |
13 | 692780924a01 |
14 | 2d7b79aa6890 |
15 | 15ca6b79db3a |
hex | aeee2302c0e |
12021113302030 has 32 divisors (see below), whose sum is σ = 24960260906496. Its totient is φ = 4083005637024.
The previous prime is 12021113301979. The next prime is 12021113302057. The reversal of 12021113302030 is 3020331112021.
It is a super-2 number, since 2×120211133020302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12021113301989 and 12021113302007.
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, 802470034 + ... + 802485013.
It is an arithmetic number, because the mean of its divisors is an integer number (780008153328).
Almost surely, 212021113302030 is an apocalyptic number.
12021113302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12021113302030 is an abundant number, since it is smaller than the sum of its proper divisors (12939147604466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021113302030 is a wasteful number, since it uses less digits than its factorization.
12021113302030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1604955168.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12021113302030 its reverse (3020331112021), we get a palindrome (15041444414051).
The spelling of 12021113302030 in words is "twelve trillion, twenty-one billion, one hundred thirteen million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •