Base | Representation |
---|---|
bin | 11101101111111111111… |
… | …11111100000000110000 |
3 | 10121201111000210001100220 |
4 | 32313333333330000300 |
5 | 113221432230400422 |
6 | 2101332044413040 |
7 | 133565060224302 |
oct | 16677777740060 |
9 | 3551430701326 |
10 | 1022202200112 |
11 | 364571547505 |
12 | 146139547180 |
13 | 75515c95362 |
14 | 37690dbd972 |
15 | 1b8ca9d5e5c |
hex | edffffc030 |
1022202200112 has 40 divisors (see below), whose sum is σ = 2731747262640. Its totient is φ = 328984615680.
The previous prime is 1022202200099. The next prime is 1022202200113. The reversal of 1022202200112 is 2110022022201.
It is a junction number, because it is equal to n+sod(n) for n = 1022202200091 and 1022202200100.
It is not an unprimeable number, because it can be changed into a prime (1022202200113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 367168939 + ... + 367171722.
It is an arithmetic number, because the mean of its divisors is an integer number (68293681566).
Almost surely, 21022202200112 is an apocalyptic number.
1022202200112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022202200112 is an abundant number, since it is smaller than the sum of its proper divisors (1709545062528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022202200112 is a wasteful number, since it uses less digits than its factorization.
1022202200112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 734340701 (or 734340695 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1022202200112 its reverse (2110022022201), we get a palindrome (3132224222313).
The spelling of 1022202200112 in words is "one trillion, twenty-two billion, two hundred two million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •