Base | Representation |
---|---|
bin | 1011000110010000011001… |
… | …1111011101110111000010 |
3 | 1121012111210002120200220010 |
4 | 2301210012133131313002 |
5 | 3044404410404000002 |
6 | 41541323350125350 |
7 | 2366400454116330 |
oct | 261440637356702 |
9 | 47174702520803 |
10 | 12202111000002 |
11 | 3984982607600 |
12 | 1450a26350856 |
13 | 6a686717b691 |
14 | 30282a1b0b50 |
15 | 16261188146c |
hex | b19067dddc2 |
12202111000002 has 192 divisors, whose sum is σ = 31764416302080. Its totient is φ = 3056871143040.
The previous prime is 12202110999979. The next prime is 12202111000067. The reversal of 12202111000002 is 20000011120221.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 15507493 + ... + 16275335.
It is an arithmetic number, because the mean of its divisors is an integer number (165439668240).
Almost surely, 212202111000002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12202111000002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15882208151040).
12202111000002 is an abundant number, since it is smaller than the sum of its proper divisors (19562305302078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12202111000002 is a wasteful number, since it uses less digits than its factorization.
12202111000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767989 (or 767978 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12202111000002 its reverse (20000011120221), we get a palindrome (32202122120223).
The spelling of 12202111000002 in words is "twelve trillion, two hundred two billion, one hundred eleven million, two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •