Base | Representation |
---|---|
bin | 10111100010101010… |
… | …00001110101101000 |
3 | 1012121211001100010111 |
4 | 23301111001311220 |
5 | 201341010144300 |
6 | 5450044224104 |
7 | 625125440500 |
oct | 136125016550 |
9 | 35554040114 |
10 | 12638756200 |
11 | 53a6280664 |
12 | 254883b034 |
13 | 12655aca85 |
14 | 87c7b2a00 |
15 | 4de8969ba |
hex | 2f1541d68 |
12638756200 has 216 divisors, whose sum is σ = 34829319330. Its totient is φ = 4252416000.
The previous prime is 12638756189. The next prime is 12638756201. The reversal of 12638756200 is 265783621.
It can be written as a sum of positive squares in 9 ways, for example, as 148011556 + 12490744644 = 12166^2 + 111762^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (12638756201) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 111847344 + ... + 111847456.
Almost surely, 212638756200 is an apocalyptic number.
12638756200 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 12638756200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17414659665).
12638756200 is an abundant number, since it is smaller than the sum of its proper divisors (22190563130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12638756200 is a wasteful number, since it uses less digits than its factorization.
12638756200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 357 (or 228 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 12638756200 in words is "twelve billion, six hundred thirty-eight million, seven hundred fifty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •