Base | Representation |
---|---|
bin | 10111110000001011… |
… | …11101100110100000 |
3 | 1012220201121021111212 |
4 | 23320011331212200 |
5 | 202104033402300 |
6 | 5505220525252 |
7 | 631004212160 |
oct | 137005754640 |
9 | 35821537455 |
10 | 12752247200 |
11 | 5454347080 |
12 | 257a850828 |
13 | 1282c68104 |
14 | 88d8b65a0 |
15 | 4e9813935 |
hex | 2f817d9a0 |
12752247200 has 144 divisors (see below), whose sum is σ = 38813390784. Its totient is φ = 3974707200.
The previous prime is 12752247199. The next prime is 12752247217. The reversal of 12752247200 is 274225721.
12752247200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41909 + ... + 165108.
It is an arithmetic number, because the mean of its divisors is an integer number (269537436).
Almost surely, 212752247200 is an apocalyptic number.
12752247200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12752247200 is an abundant number, since it is smaller than the sum of its proper divisors (26061143584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12752247200 is a wasteful number, since it uses less digits than its factorization.
12752247200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207055 (or 207042 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 32.
It can be divided in two parts, 12752 and 247200, that added together give a palindrome (259952).
The spelling of 12752247200 in words is "twelve billion, seven hundred fifty-two million, two hundred forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •