Base | Representation |
---|---|
bin | 10110110100000001… |
… | …00101001011100001 |
3 | 1011121112212110220201 |
4 | 23122000211023201 |
5 | 200040331114334 |
6 | 5343150505201 |
7 | 612335126206 |
oct | 133200451341 |
9 | 34545773821 |
10 | 12247519969 |
11 | 5215451033 |
12 | 2459805201 |
13 | 1202519449 |
14 | 84284dcad |
15 | 4ba364c14 |
hex | 2da0252e1 |
12247519969 has 4 divisors (see below), whose sum is σ = 12267899140. Its totient is φ = 12227140800.
The previous prime is 12247519939. The next prime is 12247519993. The reversal of 12247519969 is 96991574221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 96991574221 = 203051 ⋅477671.
It can be written as a sum of positive squares in 2 ways, for example, as 8480015569 + 3767504400 = 92087^2 + 61380^2 .
It is a cyclic number.
It is not a de Polignac number, because 12247519969 - 25 = 12247519937 is a prime.
It is a super-2 number, since 2×122475199692 (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 (12247519939) 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, 10188684 + ... + 10189885.
It is an arithmetic number, because the mean of its divisors is an integer number (3066974785).
Almost surely, 212247519969 is an apocalyptic number.
It is an amenable number.
12247519969 is a deficient number, since it is larger than the sum of its proper divisors (20379171).
12247519969 is an equidigital number, since it uses as much as digits as its factorization.
12247519969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20379170.
The product of its digits is 2449440, while the sum is 55.
The spelling of 12247519969 in words is "twelve billion, two hundred forty-seven million, five hundred nineteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •