Base | Representation |
---|---|
bin | 10110110001111101… |
… | …11110001111001100 |
3 | 1011120100111200111120 |
4 | 23120332332033030 |
5 | 200021430233400 |
6 | 5341334120540 |
7 | 612036004554 |
oct | 133076761714 |
9 | 34510450446 |
10 | 12230321100 |
11 | 5206774298 |
12 | 2453ab0150 |
13 | 11cbaa6cba |
14 | 840454164 |
15 | 4b8ab8ca0 |
hex | 2d8fbe3cc |
12230321100 has 144 divisors (see below), whose sum is σ = 35726880000. Its totient is φ = 3230219520.
The previous prime is 12230321099. The next prime is 12230321141. The reversal of 12230321100 is 112303221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12230321100.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20835007 + ... + 20835593.
Almost surely, 212230321100 is an apocalyptic number.
12230321100 is a gapful number since it is divisible by the number (10) 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 12230321100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17863440000).
12230321100 is an abundant number, since it is smaller than the sum of its proper divisors (23496558900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12230321100 is a wasteful number, since it uses less digits than its factorization.
12230321100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152 (or 1145 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12230321100 its reverse (112303221), we get a palindrome (12342624321).
The spelling of 12230321100 in words is "twelve billion, two hundred thirty million, three hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •