Base | Representation |
---|---|
bin | 10110100010100100… |
… | …00011000110010100 |
3 | 1011020100100202222210 |
4 | 23101102003012110 |
5 | 144240340312040 |
6 | 5320440353420 |
7 | 605606454435 |
oct | 132122030624 |
9 | 34210322883 |
10 | 12101104020 |
11 | 514a837615 |
12 | 2418775870 |
13 | 11ab0a39a5 |
14 | 82b21948c |
15 | 4ac592480 |
hex | 2d1483194 |
12101104020 has 48 divisors (see below), whose sum is σ = 33929820288. Its totient is φ = 3222510720.
The previous prime is 12101104019. The next prime is 12101104051. The reversal of 12101104020 is 2040110121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 12101103987 and 12101104005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95091 + ... + 182330.
It is an arithmetic number, because the mean of its divisors is an integer number (706871256).
Almost surely, 212101104020 is an apocalyptic number.
12101104020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12101104020 is an abundant number, since it is smaller than the sum of its proper divisors (21828716268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101104020 is a wasteful number, since it uses less digits than its factorization.
12101104020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278160 (or 278158 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12101104020 its reverse (2040110121), we get a palindrome (14141214141).
The spelling of 12101104020 in words is "twelve billion, one hundred one million, one hundred four thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •