Base | Representation |
---|---|
bin | 1001001001100110010011… |
… | …01010001101011110011001 |
3 | 2122020112211210022112000210 |
4 | 10210303021222031132121 |
5 | 10114130312041200441 |
6 | 110443244152321333 |
7 | 4144460246632410 |
oct | 444631152153631 |
9 | 78215753275023 |
10 | 20121010100121 |
11 | 64582aa714347 |
12 | 230b7056a3249 |
13 | b2c531833588 |
14 | 4d7c0d7c0477 |
15 | 24d5d8865616 |
hex | 124cc9a8d799 |
20121010100121 has 16 divisors (see below), whose sum is σ = 30667735612800. Its totient is φ = 11495039259648.
The previous prime is 20121010100071. The next prime is 20121010100129. The reversal of 20121010100121 is 12100101012102.
It is not a de Polignac number, because 20121010100121 - 29 = 20121010099609 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20121010100097 and 20121010100106.
It is not an unprimeable number, because it can be changed into a prime (20121010100129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111607686 + ... + 111787823.
It is an arithmetic number, because the mean of its divisors is an integer number (1916733475800).
Almost surely, 220121010100121 is an apocalyptic number.
20121010100121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20121010100121 is a deficient number, since it is larger than the sum of its proper divisors (10546725512679).
20121010100121 is a wasteful number, since it uses less digits than its factorization.
20121010100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223399808.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20121010100121 its reverse (12100101012102), we get a palindrome (32221111112223).
The spelling of 20121010100121 in words is "twenty trillion, one hundred twenty-one billion, ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •