Base | Representation |
---|---|
bin | 10110110001110100… |
… | …01010110111101111 |
3 | 1011120021010201111221 |
4 | 23120322022313233 |
5 | 200021114442002 |
6 | 5341251124211 |
7 | 612022212232 |
oct | 133072126757 |
9 | 34507121457 |
10 | 12229062127 |
11 | 5205a94417 |
12 | 24535a3667 |
13 | 11cb755c49 |
14 | 840207419 |
15 | 4b891ac37 |
hex | 2d8e8adef |
12229062127 has 4 divisors (see below), whose sum is σ = 12396583600. Its totient is φ = 12061540656.
The previous prime is 12229062121. The next prime is 12229062133. The reversal of 12229062127 is 72126092221.
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: 72126092221 = 41 ⋅1759172981.
It is an interprime number because it is at equal distance from previous prime (12229062121) and next prime (12229062133).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12229062127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12229062092 and 12229062101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12229062121) 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, 83760627 + ... + 83760772.
It is an arithmetic number, because the mean of its divisors is an integer number (3099145900).
Almost surely, 212229062127 is an apocalyptic number.
12229062127 is a deficient number, since it is larger than the sum of its proper divisors (167521473).
12229062127 is an equidigital number, since it uses as much as digits as its factorization.
12229062127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167521472.
The product of its (nonzero) digits is 12096, while the sum is 34.
The spelling of 12229062127 in words is "twelve billion, two hundred twenty-nine million, sixty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •