Base | Representation |
---|---|
bin | 10110111010101001… |
… | …01001101110101011 |
3 | 1011202102110220101201 |
4 | 23131110221232223 |
5 | 200144044110011 |
6 | 5352454225031 |
7 | 613611510331 |
oct | 133524515653 |
9 | 34672426351 |
10 | 12303113131 |
11 | 5243871aa1 |
12 | 2474355177 |
13 | 1210bb25ca |
14 | 849da1b51 |
15 | 4c0196cc1 |
hex | 2dd529bab |
12303113131 has 4 divisors (see below), whose sum is σ = 12303368064. Its totient is φ = 12302858200.
The previous prime is 12303113117. The next prime is 12303113177. The reversal of 12303113131 is 13131130321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13131130321 = 1039 ⋅12638239.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303113131 is a prime.
It is a super-2 number, since 2×123031131312 (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 = 12303113099 and 12303113108.
It is not an unprimeable number, because it can be changed into a prime (12303113831) 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, 30475 + ... + 159796.
It is an arithmetic number, because the mean of its divisors is an integer number (3075842016).
Almost surely, 212303113131 is an apocalyptic number.
12303113131 is a deficient number, since it is larger than the sum of its proper divisors (254933).
12303113131 is an equidigital number, since it uses as much as digits as its factorization.
12303113131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254932.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 12303113131 its reverse (13131130321), we get a palindrome (25434243452).
The spelling of 12303113131 in words is "twelve billion, three hundred three million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •