Base | Representation |
---|---|
bin | 1001001001000001010000… |
… | …01111111001001000111010 |
3 | 2122011122111202201112001221 |
4 | 10210200220033321020322 |
5 | 10113314044240400442 |
6 | 110430154505502254 |
7 | 4143154355364565 |
oct | 444405017711072 |
9 | 78148452645057 |
10 | 20101122200122 |
11 | 644a9244a0757 |
12 | 23078951a198a |
13 | b2a6b2447b02 |
14 | 4d6c843594dc |
15 | 24cd2288e467 |
hex | 1248283f923a |
20101122200122 has 8 divisors (see below), whose sum is σ = 30151711701972. Its totient is φ = 10050551632800.
The previous prime is 20101122200113. The next prime is 20101122200213. The reversal of 20101122200122 is 22100222110102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10928637610801 + 9172484589321 = 3305849^2 + 3028611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201011222001222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20101122200096 and 20101122200105.
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 in 3 ways as a sum of consecutive naturals, for example, 1687579 + ... + 6561262.
Almost surely, 220101122200122 is an apocalyptic number.
20101122200122 is a deficient number, since it is larger than the sum of its proper divisors (10050589501850).
20101122200122 is a wasteful number, since it uses less digits than its factorization.
20101122200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9467264.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20101122200122 its reverse (22100222110102), we get a palindrome (42201344310224).
The spelling of 20101122200122 in words is "twenty trillion, one hundred one billion, one hundred twenty-two million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •