Base | Representation |
---|---|
bin | 1011000110001000100101… |
… | …0101010111111010100001 |
3 | 1121012022100202102220211111 |
4 | 2301202021111113322201 |
5 | 3044341110331432314 |
6 | 41540335140143321 |
7 | 2366264436124015 |
oct | 261421125277241 |
9 | 47168322386744 |
10 | 12200011202209 |
11 | 3983aa52a7426 |
12 | 145053b097b41 |
13 | 6a65c113188c |
14 | 3026ab378545 |
15 | 16253c358ec4 |
hex | b1889557ea1 |
12200011202209 has 4 divisors (see below), whose sum is σ = 12917658920004. Its totient is φ = 11482363484416.
The previous prime is 12200011202201. The next prime is 12200011202219. The reversal of 12200011202209 is 90220211000221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4544690621584 + 7655320580625 = 2131828^2 + 2766825^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200011202209 - 23 = 12200011202201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12200011202209.
It is not an unprimeable number, because it can be changed into a prime (12200011202201) 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, 358823858872 + ... + 358823858905.
It is an arithmetic number, because the mean of its divisors is an integer number (3229414730001).
Almost surely, 212200011202209 is an apocalyptic number.
It is an amenable number.
12200011202209 is a deficient number, since it is larger than the sum of its proper divisors (717647717795).
12200011202209 is an equidigital number, since it uses as much as digits as its factorization.
12200011202209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717647717794.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 12200011202209 in words is "twelve trillion, two hundred billion, eleven million, two hundred two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •