Base | Representation |
---|---|
bin | 1001001001000011010001… |
… | …00111110011011101000000 |
3 | 2122011202022000221201020221 |
4 | 10210201220213303131000 |
5 | 10113323302231210422 |
6 | 110430454010112424 |
7 | 4143223211333011 |
oct | 444415047633500 |
9 | 78152260851227 |
10 | 20102202210112 |
11 | 64503290a21a0 |
12 | 2307b36a1b714 |
13 | b2a825119a89 |
14 | 4d6d47973008 |
15 | 24cd875c73c7 |
hex | 1248689f3740 |
20102202210112 has 56 divisors (see below), whose sum is σ = 45408729534912. Its totient is φ = 8740087910400.
The previous prime is 20102202210091. The next prime is 20102202210143. The reversal of 20102202210112 is 21101220220102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 620728689 + ... + 620761072.
Almost surely, 220102202210112 is an apocalyptic number.
20102202210112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20102202210112 is an abundant number, since it is smaller than the sum of its proper divisors (25306527324800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20102202210112 is a wasteful number, since it uses less digits than its factorization.
20102202210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1241489807 (or 1241489797 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20102202210112 its reverse (21101220220102), we get a palindrome (41203422430214).
The spelling of 20102202210112 in words is "twenty trillion, one hundred two billion, two hundred two million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •