Base | Representation |
---|---|
bin | 10111100010010111… |
… | …10101001100111110 |
3 | 1012121122111211210100 |
4 | 23301023311030332 |
5 | 201334401021100 |
6 | 5445520421530 |
7 | 625066106262 |
oct | 136113651476 |
9 | 35548454710 |
10 | 12636345150 |
11 | 53a4984160 |
12 | 2547a778a6 |
13 | 1264c47510 |
14 | 87c3460a2 |
15 | 4de56c400 |
hex | 2f12f533e |
12636345150 has 288 divisors, whose sum is σ = 40216176000. Its totient is φ = 2804256000.
The previous prime is 12636345053. The next prime is 12636345151. The reversal of 12636345150 is 5154363621.
12636345150 is a `hidden beast` number, since 1 + 2 + 6 + 3 + 634 + 5 + 15 + 0 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12636345151) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 8429101 + ... + 8430599.
It is an arithmetic number, because the mean of its divisors is an integer number (139639500).
Almost surely, 212636345150 is an apocalyptic number.
12636345150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12636345150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20108088000).
12636345150 is an abundant number, since it is smaller than the sum of its proper divisors (27579830850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12636345150 is a wasteful number, since it uses less digits than its factorization.
12636345150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1672 (or 1664 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 12636345150 in words is "twelve billion, six hundred thirty-six million, three hundred forty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •