Base | Representation |
---|---|
bin | 10110100010101101… |
… | …01011011000000000 |
3 | 1011020102122102200000 |
4 | 23101112223120000 |
5 | 144241143130233 |
6 | 5320522400000 |
7 | 605623000455 |
oct | 132126533000 |
9 | 34212572600 |
10 | 12102317568 |
11 | 5150496350 |
12 | 2419060000 |
13 | 11ab40a173 |
14 | 82b45382c |
15 | 4ac731d13 |
hex | 2d15ab600 |
12102317568 has 480 divisors, whose sum is σ = 40752391680. Its totient is φ = 3553320960.
The previous prime is 12102317533. The next prime is 12102317611. The reversal of 12102317568 is 86571320121.
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 47 ways as a sum of consecutive naturals, for example, 50637193 + ... + 50637431.
It is an arithmetic number, because the mean of its divisors is an integer number (84900816).
Almost surely, 212102317568 is an apocalyptic number.
12102317568 is a gapful number since it is divisible by the number (18) 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 12102317568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20376195840).
12102317568 is an abundant number, since it is smaller than the sum of its proper divisors (28650074112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102317568 is an equidigital number, since it uses as much as digits as its factorization.
12102317568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320 (or 292 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
Adding to 12102317568 its reverse (86571320121), we get a palindrome (98673637689).
The spelling of 12102317568 in words is "twelve billion, one hundred two million, three hundred seventeen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •