Base | Representation |
---|---|
bin | 10110011001000001… |
… | …11110111100110110 |
3 | 1011000202212211112020 |
4 | 23030200332330312 |
5 | 144104402224420 |
6 | 5304502334010 |
7 | 603615642210 |
oct | 131440767466 |
9 | 34022784466 |
10 | 12021133110 |
11 | 5109686258 |
12 | 23b5a2a306 |
13 | 119765391c |
14 | 82075d5b0 |
15 | 4a5547340 |
hex | 2cc83ef36 |
12021133110 has 64 divisors (see below), whose sum is σ = 33009126912. Its totient is φ = 2744614656.
The previous prime is 12021133081. The next prime is 12021133127. The reversal of 12021133110 is 1133112021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12021133110.
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 31 ways as a sum of consecutive naturals, for example, 158914 + ... + 222026.
It is an arithmetic number, because the mean of its divisors is an integer number (515767608).
Almost surely, 212021133110 is an apocalyptic number.
12021133110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12021133110 is an abundant number, since it is smaller than the sum of its proper divisors (20987993802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021133110 is a wasteful number, since it uses less digits than its factorization.
12021133110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64037.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 12021133110 its reverse (1133112021), we get a palindrome (13154245131).
The spelling of 12021133110 in words is "twelve billion, twenty-one million, one hundred thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •