Base | Representation |
---|---|
bin | 10111101111111011… |
… | …11110000000000000 |
3 | 1012220120122211000000 |
4 | 23313331332000000 |
5 | 202103014323210 |
6 | 5505104000000 |
7 | 630650333610 |
oct | 136775760000 |
9 | 35816584000 |
10 | 12750151680 |
11 | 5453145742 |
12 | 257a000000 |
13 | 12826b3366 |
14 | 88d4cca40 |
15 | 4e954cac0 |
hex | 2f7f7e000 |
12750151680 has 784 divisors, whose sum is σ = 53290098144. Its totient is φ = 2866544640.
The previous prime is 12750151679. The next prime is 12750151693. The reversal of 12750151680 is 8615105721.
12750151680 is a `hidden beast` number, since 1 + 27 + 501 + 51 + 6 + 80 = 666.
It is a super-3 number, since 3×127501516803 (a number of 31 digits) contains 333 as substring.
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 55 ways as a sum of consecutive naturals, for example, 209018850 + ... + 209018910.
Almost surely, 212750151680 is an apocalyptic number.
12750151680 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 12750151680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26645049072).
12750151680 is an abundant number, since it is smaller than the sum of its proper divisors (40539946464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12750151680 is an frugal number, since it uses more digits than its factorization.
12750151680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 78 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
The spelling of 12750151680 in words is "twelve billion, seven hundred fifty million, one hundred fifty-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •