Base | Representation |
---|---|
bin | 10110110000001010… |
… | …01001100000000000 |
3 | 1011112021222120100000 |
4 | 23120011021200000 |
5 | 200004040203010 |
6 | 5340033200000 |
7 | 611463112524 |
oct | 133005114000 |
9 | 34467876300 |
10 | 12215162880 |
11 | 51a9160738 |
12 | 244aa00000 |
13 | 11c88ca63b |
14 | 83c429d84 |
15 | 4b75c27c0 |
hex | 2d8149800 |
12215162880 has 288 divisors, whose sum is σ = 43912486800. Its totient is φ = 3256713216.
The previous prime is 12215162873. The next prime is 12215162899. The reversal of 12215162880 is 8826151221.
12215162880 is a `hidden beast` number, since 1 + 2 + 21 + 5 + 1 + 628 + 8 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2485866 + ... + 2490774.
Almost surely, 212215162880 is an apocalyptic number.
12215162880 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 12215162880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21956243400).
12215162880 is an abundant number, since it is smaller than the sum of its proper divisors (31697323920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12215162880 is an frugal number, since it uses more digits than its factorization.
12215162880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4951 (or 4919 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 36.
The spelling of 12215162880 in words is "twelve billion, two hundred fifteen million, one hundred sixty-two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •