Base | Representation |
---|---|
bin | 10110101000000100… |
… | …00100100000011111 |
3 | 1011100120012002110001 |
4 | 23110002010200133 |
5 | 144334143402020 |
6 | 5325205355131 |
7 | 610006616452 |
oct | 132402044037 |
9 | 34316162401 |
10 | 12147247135 |
11 | 5173893621 |
12 | 2430108aa7 |
13 | 11b780b6ca |
14 | 8333cb499 |
15 | 4b165950a |
hex | 2d408481f |
12147247135 has 4 divisors (see below), whose sum is σ = 14576696568. Its totient is φ = 9717797704.
The previous prime is 12147247129. The next prime is 12147247159. The reversal of 12147247135 is 53174274121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53174274121 = 97 ⋅548188393.
It is a cyclic number.
It is not a de Polignac number, because 12147247135 - 23 = 12147247127 is a prime.
It is a super-2 number, since 2×121472471352 (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 = 12147247094 and 12147247103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1214724709 + ... + 1214724718.
It is an arithmetic number, because the mean of its divisors is an integer number (3644174142).
Almost surely, 212147247135 is an apocalyptic number.
12147247135 is a deficient number, since it is larger than the sum of its proper divisors (2429449433).
12147247135 is an equidigital number, since it uses as much as digits as its factorization.
12147247135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2429449432.
The product of its digits is 47040, while the sum is 37.
The spelling of 12147247135 in words is "twelve billion, one hundred forty-seven million, two hundred forty-seven thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •