Base | Representation |
---|---|
bin | 10110110010000110100111… |
… | …011111000111110101100110 |
3 | 111010210000222101112110020210 |
4 | 112302012213133013311212 |
5 | 101113134302103031042 |
6 | 553035142535040250 |
7 | 30051134636120241 |
oct | 2662064737076546 |
9 | 433700871473223 |
10 | 100200102002022 |
11 | 29a21696406a70 |
12 | b2a354b510086 |
13 | 43baaa1629c39 |
14 | 1aa59d4686258 |
15 | b8b67bb91a9c |
hex | 5b21a77c7d66 |
100200102002022 has 64 divisors (see below), whose sum is σ = 224734490150400. Its totient is φ = 29525927558400.
The previous prime is 100200102001943. The next prime is 100200102002027. The reversal of 100200102002022 is 220200201002001.
It is a super-2 number, since 2×1002001020020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100200102001989 and 100200102002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200102002027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 146115897 + ... + 146800052.
It is an arithmetic number, because the mean of its divisors is an integer number (3511476408600).
Almost surely, 2100200102002022 is an apocalyptic number.
100200102002022 is an abundant number, since it is smaller than the sum of its proper divisors (124534388148378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100200102002022 is a wasteful number, since it uses less digits than its factorization.
100200102002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292916109.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 100200102002022 its reverse (220200201002001), we get a palindrome (320400303004023).
The spelling of 100200102002022 in words is "one hundred trillion, two hundred billion, one hundred two million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •