Base | Representation |
---|---|
bin | 10111111010010011… |
… | …10111010101110001 |
3 | 1020010122101002202222 |
4 | 23331021313111301 |
5 | 202242302444314 |
6 | 5521452450425 |
7 | 633055012253 |
oct | 137511672561 |
9 | 36118332688 |
10 | 12837156209 |
11 | 5498270509 |
12 | 25a3179a15 |
13 | 1297726a27 |
14 | 89ac99cd3 |
15 | 501ed6c8e |
hex | 2fd277571 |
12837156209 has 4 divisors (see below), whose sum is σ = 12841761780. Its totient is φ = 12832550640.
The previous prime is 12837156197. The next prime is 12837156217. The reversal of 12837156209 is 90265173821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90265173821 = 292091 ⋅309031.
It can be written as a sum of positive squares in 2 ways, for example, as 4458499984 + 8378656225 = 66772^2 + 91535^2 .
It is a cyclic number.
It is not a de Polignac number, because 12837156209 - 24 = 12837156193 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12837156209.
It is not an unprimeable number, because it can be changed into a prime (12837156509) 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, 2298602 + ... + 2304179.
It is an arithmetic number, because the mean of its divisors is an integer number (3210440445).
Almost surely, 212837156209 is an apocalyptic number.
It is an amenable number.
12837156209 is a deficient number, since it is larger than the sum of its proper divisors (4605571).
12837156209 is an equidigital number, since it uses as much as digits as its factorization.
12837156209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4605570.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 12837156209 in words is "twelve billion, eight hundred thirty-seven million, one hundred fifty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •