Base | Representation |
---|---|
bin | 10110100011101111… |
… | …10110000011011100 |
3 | 1011021001000011021020 |
4 | 23101313312003130 |
5 | 144300404341220 |
6 | 5321433004140 |
7 | 606056622030 |
oct | 132167660334 |
9 | 34231004236 |
10 | 12111012060 |
11 | 5155394684 |
12 | 241bb53650 |
13 | 11b0162734 |
14 | 82c6781c0 |
15 | 4ad39d040 |
hex | 2d1df60dc |
12111012060 has 48 divisors (see below), whose sum is σ = 38755239936. Its totient is φ = 2768231232.
The previous prime is 12111012059. The next prime is 12111012077. The reversal of 12111012060 is 6021011121.
It is a happy number.
It is a super-2 number, since 2×121110120602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14417452 + ... + 14418291.
It is an arithmetic number, because the mean of its divisors is an integer number (807400832).
Almost surely, 212111012060 is an apocalyptic number.
12111012060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12111012060 is an abundant number, since it is smaller than the sum of its proper divisors (26644227876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111012060 is a wasteful number, since it uses less digits than its factorization.
12111012060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28835762 (or 28835760 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 12111012060 its reverse (6021011121), we get a palindrome (18132023181).
The spelling of 12111012060 in words is "twelve billion, one hundred eleven million, twelve thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •