Base | Representation |
---|---|
bin | 1001010010111000111010… |
… | …1000001111001111000110 |
3 | 1100012000220202001102112212 |
4 | 2110232032220033033012 |
5 | 2314421301222010042 |
6 | 33423020334543422 |
7 | 2103244050405224 |
oct | 224561650171706 |
9 | 40160822042485 |
10 | 10220120110022 |
11 | 3290368400719 |
12 | 1190889667b72 |
13 | 5919a39b7334 |
14 | 27492943db14 |
15 | 12acae95b482 |
hex | 94b8ea0f3c6 |
10220120110022 has 8 divisors (see below), whose sum is σ = 15330817110672. Its totient is φ = 5109847739800.
The previous prime is 10220120109959. The next prime is 10220120110027. The reversal of 10220120110022 is 22001102102201.
10220120110022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10220120109979 and 10220120110006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220120110027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106097429 + ... + 106193712.
It is an arithmetic number, because the mean of its divisors is an integer number (1916352138834).
Almost surely, 210220120110022 is an apocalyptic number.
10220120110022 is a deficient number, since it is larger than the sum of its proper divisors (5110697000650).
10220120110022 is a wasteful number, since it uses less digits than its factorization.
10220120110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212315214.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10220120110022 its reverse (22001102102201), we get a palindrome (32221222212223).
The spelling of 10220120110022 in words is "ten trillion, two hundred twenty billion, one hundred twenty million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •