Base | Representation |
---|---|
bin | 1001001001000001010000… |
… | …01111001010111111110001 |
3 | 2122011122111202100220210220 |
4 | 10210200220033022333301 |
5 | 10113314044213323441 |
6 | 110430154501443253 |
7 | 4143154353646554 |
oct | 444405017127761 |
9 | 78148452326726 |
10 | 20101122011121 |
11 | 644a924381758 |
12 | 2307895110529 |
13 | b2a6b23aca88 |
14 | 4d6c8430a69b |
15 | 24cd22853466 |
hex | 1248283caff1 |
20101122011121 has 64 divisors (see below), whose sum is σ = 28966042828800. Its totient is φ = 12358243566144.
The previous prime is 20101122011107. The next prime is 20101122011143. The reversal of 20101122011121 is 12111022110102.
It is a happy number.
It is not a de Polignac number, because 20101122011121 - 218 = 20101121748977 is a prime.
It is a super-2 number, since 2×201011220111212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20101122011121.
It is not an unprimeable number, because it can be changed into a prime (20101122021121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 911067336 + ... + 911089398.
It is an arithmetic number, because the mean of its divisors is an integer number (452594419200).
Almost surely, 220101122011121 is an apocalyptic number.
It is an amenable number.
20101122011121 is a deficient number, since it is larger than the sum of its proper divisors (8864920817679).
20101122011121 is a wasteful number, since it uses less digits than its factorization.
20101122011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23370.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20101122011121 its reverse (12111022110102), we get a palindrome (32212144121223).
The spelling of 20101122011121 in words is "twenty trillion, one hundred one billion, one hundred twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •