Base | Representation |
---|---|
bin | 10111010011100110… |
… | …01111000110011001 |
3 | 1012022000101200100112 |
4 | 23221303033012121 |
5 | 201111142111423 |
6 | 5425333214105 |
7 | 622033062542 |
oct | 135163170631 |
9 | 35260350315 |
10 | 12512457113 |
11 | 5340a57252 |
12 | 2512491335 |
13 | 124538b9a0 |
14 | 869ad74c9 |
15 | 4d3749a78 |
hex | 2e9ccf199 |
12512457113 has 16 divisors (see below), whose sum is σ = 14300810496. Its totient is φ = 10845246720.
The previous prime is 12512457109. The next prime is 12512457127. The reversal of 12512457113 is 31175421521.
It is a cyclic number.
It is not a de Polignac number, because 12512457113 - 22 = 12512457109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12512457113.
It is not an unprimeable number, because it can be changed into a prime (12512457143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29570 + ... + 160932.
It is an arithmetic number, because the mean of its divisors is an integer number (893800656).
Almost surely, 212512457113 is an apocalyptic number.
12512457113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12512457113 is a deficient number, since it is larger than the sum of its proper divisors (1788353383).
12512457113 is a wasteful number, since it uses less digits than its factorization.
12512457113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131824.
The product of its digits is 8400, while the sum is 32.
Adding to 12512457113 its reverse (31175421521), we get a palindrome (43687878634).
The spelling of 12512457113 in words is "twelve billion, five hundred twelve million, four hundred fifty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •