Base | Representation |
---|---|
bin | 10111010000111110… |
… | …01101000010001101 |
3 | 1012020110221111212002 |
4 | 23220133031002031 |
5 | 201040022203212 |
6 | 5423225122045 |
7 | 621344614415 |
oct | 135037150215 |
9 | 35213844762 |
10 | 12490428557 |
11 | 532a580932 |
12 | 2507029325 |
13 | 1240948139 |
14 | 866c01645 |
15 | 4d1847ac2 |
hex | 2e87cd08d |
12490428557 has 18 divisors (see below), whose sum is σ = 13055316222. Its totient is φ = 11949093184.
The previous prime is 12490428541. The next prime is 12490428583. The reversal of 12490428557 is 75582409421.
12490428557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 9 ways, for example, as 2103965161 + 10386463396 = 45869^2 + 101914^2 .
It is not a de Polignac number, because 12490428557 - 24 = 12490428541 is a prime.
It is a super-2 number, since 2×124904285572 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12490428527) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 42629303 + ... + 42629595.
Almost surely, 212490428557 is an apocalyptic number.
It is an amenable number.
12490428557 is a deficient number, since it is larger than the sum of its proper divisors (564887665).
12490428557 is an frugal number, since it uses more digits than its factorization.
12490428557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817 (or 495 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 12490428557 in words is "twelve billion, four hundred ninety million, four hundred twenty-eight thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •