Base | Representation |
---|---|
bin | 1011000000111010001000… |
… | …1001001000111010011100 |
3 | 1120212201121222010102000110 |
4 | 2300032202021020322130 |
5 | 3041403224134042340 |
6 | 41431210404130020 |
7 | 2356635603010305 |
oct | 260164211107234 |
9 | 46781558112013 |
10 | 12110233112220 |
11 | 3949a14973641 |
12 | 1437064696910 |
13 | 69acb42984c9 |
14 | 2dc1d1b237ac |
15 | 160035713680 |
hex | b03a2248e9c |
12110233112220 has 48 divisors (see below), whose sum is σ = 35903279347488. Its totient is φ = 3039431055360.
The previous prime is 12110233112167. The next prime is 12110233112249. The reversal of 12110233112220 is 2221133201121.
It is a super-2 number, since 2×121102331122202 (a number of 27 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 15 ways as a sum of consecutive naturals, for example, 5936387761 + ... + 5936389800.
It is an arithmetic number, because the mean of its divisors is an integer number (747984986406).
Almost surely, 212110233112220 is an apocalyptic number.
12110233112220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12110233112220 is an abundant number, since it is smaller than the sum of its proper divisors (23793046235268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12110233112220 is a wasteful number, since it uses less digits than its factorization.
12110233112220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11872777590 (or 11872777588 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12110233112220 its reverse (2221133201121), we get a palindrome (14331366313341).
The spelling of 12110233112220 in words is "twelve trillion, one hundred ten billion, two hundred thirty-three million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •