Base | Representation |
---|---|
bin | 10110110010011011000111… |
… | …111110110010011001101100 |
3 | 111010212010211000001202210222 |
4 | 112302123013332302121230 |
5 | 101114014401213311340 |
6 | 553053223544150512 |
7 | 30052544420111000 |
oct | 2662330776623154 |
9 | 433763730052728 |
10 | 100222122010220 |
11 | 29a2aa660a9051 |
12 | b2a7875a68438 |
13 | 43bcba0665ca2 |
14 | 1aa6ac2d54700 |
15 | b8c019e238b5 |
hex | 5b26c7fb266c |
100222122010220 has 48 divisors (see below), whose sum is σ = 245441931470400. Its totient is φ = 34361870401152.
The previous prime is 100222122010211. The next prime is 100222122010223. The reversal of 100222122010220 is 22010221222001.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (100222122010223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7304812529 + ... + 7304826248.
It is an arithmetic number, because the mean of its divisors is an integer number (5113373572300).
Almost surely, 2100222122010220 is an apocalyptic number.
100222122010220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100222122010220 is an abundant number, since it is smaller than the sum of its proper divisors (145219809460180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222122010220 is a wasteful number, since it uses less digits than its factorization.
100222122010220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14609638807 (or 14609638791 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 100222122010220 its reverse (22010221222001), we get a palindrome (122232343232221).
The spelling of 100222122010220 in words is "one hundred trillion, two hundred twenty-two billion, one hundred twenty-two million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •