Base | Representation |
---|---|
bin | 10010101110000111… |
… | …001110111110100010 |
3 | 1220212212120122202001 |
4 | 102232013032332202 |
5 | 312131324013442 |
6 | 13122334114214 |
7 | 1311056455546 |
oct | 225607167642 |
9 | 56785518661 |
10 | 20101001122 |
11 | 8585544724 |
12 | 3a8b94b96a |
13 | 1b845ac007 |
14 | d89897a26 |
15 | 7c9a6c2b7 |
hex | 4ae1cefa2 |
20101001122 has 4 divisors (see below), whose sum is σ = 30151501686. Its totient is φ = 10050500560.
The previous prime is 20101001119. The next prime is 20101001131. The reversal of 20101001122 is 22110010102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 20095614081 + 5387041 = 141759^2 + 2321^2 .
It is a super-2 number, since 2×201010011222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20101001099 and 20101001108.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 5025250279 + ... + 5025250282.
Almost surely, 220101001122 is an apocalyptic number.
20101001122 is a deficient number, since it is larger than the sum of its proper divisors (10050500564).
20101001122 is a wasteful number, since it uses less digits than its factorization.
20101001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10050500563.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20101001122 its reverse (22110010102), we get a palindrome (42211011224).
The spelling of 20101001122 in words is "twenty billion, one hundred one million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •