Base | Representation |
---|---|
bin | 10110111100000101… |
… | …00000000011100011 |
3 | 1011210021002112100212 |
4 | 23132002200003203 |
5 | 200210133212011 |
6 | 5354004004335 |
7 | 614115616211 |
oct | 133602400343 |
9 | 34707075325 |
10 | 12315132131 |
11 | 524a631055 |
12 | 24783906ab |
13 | 1213530143 |
14 | 84b80dcb1 |
15 | 4c126d08b |
hex | 2de0a00e3 |
12315132131 has 4 divisors (see below), whose sum is σ = 12963297000. Its totient is φ = 11666967264.
The previous prime is 12315132091. The next prime is 12315132139. The reversal of 12315132131 is 13123151321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13123151321 = 7 ⋅1874735903.
It is a cyclic number.
It is not a de Polignac number, because 12315132131 - 222 = 12310937827 is a prime.
It is a super-2 number, since 2×123151321312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12315132097 and 12315132106.
It is not an unprimeable number, because it can be changed into a prime (12315132139) 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, 324082406 + ... + 324082443.
It is an arithmetic number, because the mean of its divisors is an integer number (3240824250).
Almost surely, 212315132131 is an apocalyptic number.
12315132131 is a deficient number, since it is larger than the sum of its proper divisors (648164869).
12315132131 is an equidigital number, since it uses as much as digits as its factorization.
12315132131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 648164868.
The product of its digits is 540, while the sum is 23.
Adding to 12315132131 its reverse (13123151321), we get a palindrome (25438283452).
The spelling of 12315132131 in words is "twelve billion, three hundred fifteen million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •