Base | Representation |
---|---|
bin | 10111010011100110… |
… | …01100000001100001 |
3 | 1012022000101001001212 |
4 | 23221303030001201 |
5 | 201111141211023 |
6 | 5425333035505 |
7 | 622033011032 |
oct | 135163140141 |
9 | 35260331055 |
10 | 12512444513 |
11 | 5340a48838 |
12 | 2512485b95 |
13 | 124538602a |
14 | 869ad2a89 |
15 | 4d3745e78 |
hex | 2e9ccc061 |
12512444513 has 4 divisors (see below), whose sum is σ = 12512912148. Its totient is φ = 12511976880.
The previous prime is 12512444507. The next prime is 12512444557. The reversal of 12512444513 is 31544421521.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8845778704 + 3666665809 = 94052^2 + 60553^2 .
It is a cyclic number.
It is not a de Polignac number, because 12512444513 - 26 = 12512444449 is a prime.
It is a super-2 number, since 2×125124445132 (a number of 21 digits) contains 22 as substring.
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 12512444513.
It is not an unprimeable number, because it can be changed into a prime (12512444213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191078 + ... + 248063.
It is an arithmetic number, because the mean of its divisors is an integer number (3128228037).
Almost surely, 212512444513 is an apocalyptic number.
It is an amenable number.
12512444513 is a deficient number, since it is larger than the sum of its proper divisors (467635).
12512444513 is an equidigital number, since it uses as much as digits as its factorization.
12512444513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467634.
The product of its digits is 19200, while the sum is 32.
The spelling of 12512444513 in words is "twelve billion, five hundred twelve million, four hundred forty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •