Base | Representation |
---|---|
bin | 1001001001000001010000… |
… | …01111001101011101011011 |
3 | 2122011122111202101102122121 |
4 | 10210200220033031131123 |
5 | 10113314044214134321 |
6 | 110430154502002111 |
7 | 4143154354021150 |
oct | 444405017153533 |
9 | 78148452342577 |
10 | 20101122021211 |
11 | 644a9243892a0 |
12 | 2307895116337 |
13 | b2a6b23b454a |
14 | 4d6c84310227 |
15 | 24cd22856441 |
hex | 1248283cd75b |
20101122021211 has 64 divisors (see below), whose sum is σ = 25843341413376. Its totient is φ = 15183984384000.
The previous prime is 20101122021151. The next prime is 20101122021257. The reversal of 20101122021211 is 11212022110102.
It is a cyclic number.
It is not a de Polignac number, because 20101122021211 - 217 = 20101121890139 is a prime.
It is a super-2 number, since 2×201011220212112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101122021311) 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, 77648556 + ... + 77906998.
It is an arithmetic number, because the mean of its divisors is an integer number (403802209584).
Almost surely, 220101122021211 is an apocalyptic number.
20101122021211 is a deficient number, since it is larger than the sum of its proper divisors (5742219392165).
20101122021211 is a wasteful number, since it uses less digits than its factorization.
20101122021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258772.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20101122021211 its reverse (11212022110102), we get a palindrome (31313144131313).
It can be divided in two parts, 201011 and 22021211, that added together give a palindrome (22222222).
The spelling of 20101122021211 in words is "twenty trillion, one hundred one billion, one hundred twenty-two million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •