Base | Representation |
---|---|
bin | 10010101110000011… |
… | …110011001110011110 |
3 | 1220212210212221001000 |
4 | 102232003303032132 |
5 | 312131111213042 |
6 | 13122302531130 |
7 | 1311046016421 |
oct | 225603631636 |
9 | 56783787030 |
10 | 20100101022 |
11 | 8584a8a441 |
12 | 3a8b596aa6 |
13 | 1b84355401 |
14 | d897019b8 |
15 | 7c994074c |
hex | 4ae0f339e |
20100101022 has 32 divisors (see below), whose sum is σ = 44676149760. Its totient is φ = 6698644920.
The previous prime is 20100101003. The next prime is 20100101027. The reversal of 20100101022 is 22010100102.
It is a super-2 number, since 2×201001010222 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20100100995 and 20100101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100101027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 243243 + ... + 315225.
It is an arithmetic number, because the mean of its divisors is an integer number (1396129680).
Almost surely, 220100101022 is an apocalyptic number.
20100101022 is an abundant number, since it is smaller than the sum of its proper divisors (24576048738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20100101022 is a wasteful number, since it uses less digits than its factorization.
20100101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77165 (or 77159 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20100101022 its reverse (22010100102), we get a palindrome (42110201124).
The spelling of 20100101022 in words is "twenty billion, one hundred million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •