Base | Representation |
---|---|
bin | 10111010011011101… |
… | …11000010010110011 |
3 | 1012021221020122211121 |
4 | 23221232320102303 |
5 | 201110344040443 |
6 | 5425252523111 |
7 | 622020265246 |
oct | 135156702263 |
9 | 35257218747 |
10 | 12511315123 |
11 | 534034725a |
12 | 2512020497 |
13 | 124507bc58 |
14 | 8698bb25d |
15 | 4d35c14ed |
hex | 2e9bb84b3 |
12511315123 has 4 divisors (see below), whose sum is σ = 12511819528. Its totient is φ = 12510810720.
The previous prime is 12511315043. The next prime is 12511315133. The reversal of 12511315123 is 32151311521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32151311521 = 7 ⋅4593044503.
It is a cyclic number.
It is not a de Polignac number, because 12511315123 - 213 = 12511306931 is a prime.
It is a super-2 number, since 2×125113151232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12511315133) 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 3 ways as a sum of consecutive naturals, for example, 212961 + ... + 265282.
It is an arithmetic number, because the mean of its divisors is an integer number (3127954882).
Almost surely, 212511315123 is an apocalyptic number.
12511315123 is a deficient number, since it is larger than the sum of its proper divisors (504405).
12511315123 is an equidigital number, since it uses as much as digits as its factorization.
12511315123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504404.
The product of its digits is 900, while the sum is 25.
Adding to 12511315123 its reverse (32151311521), we get a palindrome (44662626644).
The spelling of 12511315123 in words is "twelve billion, five hundred eleven million, three hundred fifteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •