Base | Representation |
---|---|
bin | 10110100010100101… |
… | …11000101001000100 |
3 | 1011020100202220211110 |
4 | 23101102320221010 |
5 | 144240414321312 |
6 | 5320445205020 |
7 | 605611360020 |
oct | 132122705104 |
9 | 34210686743 |
10 | 12101323332 |
11 | 514a97736a |
12 | 2418860770 |
13 | 11ab14c767 |
14 | 82b275380 |
15 | 4ac5d743c |
hex | 2d14b8a44 |
12101323332 has 96 divisors (see below), whose sum is σ = 33439436800. Its totient is φ = 3334286592.
The previous prime is 12101323309. The next prime is 12101323343. The reversal of 12101323332 is 23332310121.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 12101323299 and 12101323308.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 264144 + ... + 306552.
Almost surely, 212101323332 is an apocalyptic number.
12101323332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12101323332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16719718400).
12101323332 is an abundant number, since it is smaller than the sum of its proper divisors (21338113468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101323332 is a wasteful number, since it uses less digits than its factorization.
12101323332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42545 (or 42543 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12101323332 its reverse (23332310121), we get a palindrome (35433633453).
The spelling of 12101323332 in words is "twelve billion, one hundred one million, three hundred twenty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •