Base | Representation |
---|---|
bin | 10110101110011001… |
… | …11110000010010101 |
3 | 1011111021021100122212 |
4 | 23113030332002111 |
5 | 144441302421421 |
6 | 5334345403205 |
7 | 611223664565 |
oct | 132714760225 |
9 | 34437240585 |
10 | 12200435861 |
11 | 51a0912049 |
12 | 2445a99505 |
13 | 11c5842323 |
14 | 83a4b4da5 |
15 | 4b6163e5b |
hex | 2d733e095 |
12200435861 has 4 divisors (see below), whose sum is σ = 12337519500. Its totient is φ = 12063352224.
The previous prime is 12200435839. The next prime is 12200435869. The reversal of 12200435861 is 16853400221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16853400221 = 7 ⋅2407628603.
It can be written as a sum of positive squares in 2 ways, for example, as 7919220100 + 4281215761 = 88990^2 + 65431^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200435861 - 214 = 12200419477 is a prime.
It is a super-2 number, since 2×122004358612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200435869) 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, 68541686 + ... + 68541863.
It is an arithmetic number, because the mean of its divisors is an integer number (3084379875).
Almost surely, 212200435861 is an apocalyptic number.
It is an amenable number.
12200435861 is a deficient number, since it is larger than the sum of its proper divisors (137083639).
12200435861 is an equidigital number, since it uses as much as digits as its factorization.
12200435861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137083638.
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 12200435861 in words is "twelve billion, two hundred million, four hundred thirty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •