Base | Representation |
---|---|
bin | 1001001001101000100011… |
… | …11001001111111110110110 |
3 | 2122020122222020201112000100 |
4 | 10210310101321033332312 |
5 | 10114140302313031402 |
6 | 110444004323454530 |
7 | 4144532263631343 |
oct | 444642171177666 |
9 | 78218866645010 |
10 | 20122222002102 |
11 | 645887180a230 |
12 | 230b9a3527446 |
13 | b2c69593423c |
14 | 4d7cc672b7ca |
15 | 24d659e5271c |
hex | 124d11e4ffb6 |
20122222002102 has 96 divisors (see below), whose sum is σ = 47630691703296. Its totient is φ = 6088790736000.
The previous prime is 20122222002079. The next prime is 20122222002139. The reversal of 20122222002102 is 20120022222102.
20122222002102 is a `hidden beast` number, since 20 + 12 + 222 + 200 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 833171727 + ... + 833195877.
It is an arithmetic number, because the mean of its divisors is an integer number (496153038576).
Almost surely, 220122222002102 is an apocalyptic number.
20122222002102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20122222002102 is an abundant number, since it is smaller than the sum of its proper divisors (27508469701194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122222002102 is a wasteful number, since it uses less digits than its factorization.
20122222002102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30106 (or 30103 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 20122222002102 its reverse (20120022222102), we get a palindrome (40242244224204).
The spelling of 20122222002102 in words is "twenty trillion, one hundred twenty-two billion, two hundred twenty-two million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •