Base | Representation |
---|---|
bin | 10111101111101111… |
… | …11011001000111100 |
3 | 1012220110200022100212 |
4 | 23313313323020330 |
5 | 202102113121400 |
6 | 5505010011552 |
7 | 630631014053 |
oct | 136767731074 |
9 | 35813608325 |
10 | 12748567100 |
11 | 5452263175 |
12 | 2579576bb8 |
13 | 128227a039 |
14 | 88d1d939a |
15 | 4e9338335 |
hex | 2f7dfb23c |
12748567100 has 72 divisors (see below), whose sum is σ = 28649083008. Its totient is φ = 4918982400.
The previous prime is 12748567099. The next prime is 12748567151. The reversal of 12748567100 is 176584721.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 976214 + ... + 989186.
Almost surely, 212748567100 is an apocalyptic number.
12748567100 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 12748567100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14324541504).
12748567100 is an abundant number, since it is smaller than the sum of its proper divisors (15900515908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12748567100 is a wasteful number, since it uses less digits than its factorization.
12748567100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13335 (or 13328 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 41.
The spelling of 12748567100 in words is "twelve billion, seven hundred forty-eight million, five hundred sixty-seven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •