Base | Representation |
---|---|
bin | 10111011011011001… |
… | …01100000110011000 |
3 | 1012110120102222012010 |
4 | 23231230230012120 |
5 | 201224412143002 |
6 | 5440030545520 |
7 | 623455646616 |
oct | 135554540630 |
9 | 35416388163 |
10 | 12577849752 |
11 | 5374960756 |
12 | 25303682a0 |
13 | 1255aa6360 |
14 | 87467a6b6 |
15 | 4d936546c |
hex | 2edb2c198 |
12577849752 has 64 divisors (see below), whose sum is σ = 34292160000. Its totient is φ = 3821111424.
The previous prime is 12577849747. The next prime is 12577849769. The reversal of 12577849752 is 25794877521.
It is a happy number.
12577849752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12577849692 and 12577849701.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 230502 + ... + 279797.
It is an arithmetic number, because the mean of its divisors is an integer number (535815000).
Almost surely, 212577849752 is an apocalyptic number.
12577849752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12577849752 is an abundant number, since it is smaller than the sum of its proper divisors (21714310248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12577849752 is a wasteful number, since it uses less digits than its factorization.
12577849752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510400 (or 510396 counting only the distinct ones).
The product of its digits is 9878400, while the sum is 57.
The spelling of 12577849752 in words is "twelve billion, five hundred seventy-seven million, eight hundred forty-nine thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •