Base | Representation |
---|---|
bin | 101111000010000010… |
… | …1010000110101110110 |
3 | 100122200212201210011201 |
4 | 1132010011100311312 |
5 | 3123322024020042 |
6 | 114222053123114 |
7 | 10203610463602 |
oct | 1360405206566 |
9 | 318625653151 |
10 | 101000220022 |
11 | 39919a9a219 |
12 | 176a892949a |
13 | 96a7ac5b00 |
14 | 4c61c28502 |
15 | 2961e611b7 |
hex | 1784150d76 |
101000220022 has 48 divisors (see below), whose sum is σ = 171563905440. Its totient is φ = 44489592576.
The previous prime is 101000220011. The next prime is 101000220023. The reversal of 101000220022 is 220022000101.
101000220022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
101000220022 is a modest number, since divided by 220022 gives 1010 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 101000219990 and 101000220008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000220023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3538504 + ... + 3566932.
It is an arithmetic number, because the mean of its divisors is an integer number (3574248030).
Almost surely, 2101000220022 is an apocalyptic number.
101000220022 is a deficient number, since it is larger than the sum of its proper divisors (70563685418).
101000220022 is a wasteful number, since it uses less digits than its factorization.
101000220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28937 (or 28924 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 101000220022 its reverse (220022000101), we get a palindrome (321022220123).
The spelling of 101000220022 in words is "one hundred one billion, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •