Base | Representation |
---|---|
bin | 10110100011101111… |
… | …10011010110111100 |
3 | 1011021000222121010100 |
4 | 23101313303112330 |
5 | 144300404013040 |
6 | 5321432441100 |
7 | 606056544606 |
oct | 132167632674 |
9 | 34230877110 |
10 | 12111001020 |
11 | 5155387358 |
12 | 241bb49190 |
13 | 11b015a6c1 |
14 | 82c674176 |
15 | 4ad399b30 |
hex | 2d1df35bc |
12111001020 has 36 divisors (see below), whose sum is σ = 36736703640. Its totient is φ = 3229600224.
The previous prime is 12111000989. The next prime is 12111001039. The reversal of 12111001020 is 2010011121.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12111000993 and 12111001011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33641490 + ... + 33641849.
It is an arithmetic number, because the mean of its divisors is an integer number (1020463990).
Almost surely, 212111001020 is an apocalyptic number.
12111001020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12111001020 is an abundant number, since it is smaller than the sum of its proper divisors (24625702620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111001020 is a wasteful number, since it uses less digits than its factorization.
12111001020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67283354 (or 67283349 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12111001020 its reverse (2010011121), we get a palindrome (14121012141).
The spelling of 12111001020 in words is "twelve billion, one hundred eleven million, one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •