Base | Representation |
---|---|
bin | 1011000110001000100111… |
… | …1111010100111100101101 |
3 | 1121012022101112010200010010 |
4 | 2301202021333110330231 |
5 | 3044341121140400414 |
6 | 41540340212003433 |
7 | 2366264631450612 |
oct | 261421177247455 |
9 | 47168345120103 |
10 | 12200022200109 |
11 | 39840005292a7 |
12 | 1450542900579 |
13 | 6a65c34b2703 |
14 | 3026ac9dc509 |
15 | 16253d2cc959 |
hex | b1889fd4f2d |
12200022200109 has 4 divisors (see below), whose sum is σ = 16266696266816. Its totient is φ = 8133348133404.
The previous prime is 12200022200063. The next prime is 12200022200123. The reversal of 12200022200109 is 90100222000221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 12200022200109 - 220 = 12200021151533 is a prime.
It is a super-2 number, since 2×122000222001092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200022200309) 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, 2033337033349 + ... + 2033337033354.
It is an arithmetic number, because the mean of its divisors is an integer number (4066674066704).
Almost surely, 212200022200109 is an apocalyptic number.
It is an amenable number.
12200022200109 is a deficient number, since it is larger than the sum of its proper divisors (4066674066707).
12200022200109 is an equidigital number, since it uses as much as digits as its factorization.
12200022200109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4066674066706.
The product of its (nonzero) digits is 288, while the sum is 21.
The spelling of 12200022200109 in words is "twelve trillion, two hundred billion, twenty-two million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •