Base | Representation |
---|---|
bin | 1001001001010101110000… |
… | …11011101000101011011001 |
3 | 2122012200220222222012201010 |
4 | 10210222320123220223121 |
5 | 10114004121032211441 |
6 | 110435215133244133 |
7 | 4144024233641340 |
oct | 444527033505331 |
9 | 78180828865633 |
10 | 20112131132121 |
11 | 645456377a266 |
12 | 2309a48033649 |
13 | b2b74817bb62 |
14 | 4d760a4b2b57 |
15 | 24d2690e5116 |
hex | 124ab86e8ad9 |
20112131132121 has 32 divisors (see below), whose sum is σ = 30680277884928. Its totient is φ = 11480190096960.
The previous prime is 20112131132083. The next prime is 20112131132167. The reversal of 20112131132121 is 12123113121102.
It is not a de Polignac number, because 20112131132121 - 222 = 20112126937817 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (20112131132321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 486472911 + ... + 486514251.
It is an arithmetic number, because the mean of its divisors is an integer number (958758683904).
Almost surely, 220112131132121 is an apocalyptic number.
20112131132121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20112131132121 is a deficient number, since it is larger than the sum of its proper divisors (10568146752807).
20112131132121 is a wasteful number, since it uses less digits than its factorization.
20112131132121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65901.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 20112131132121 its reverse (12123113121102), we get a palindrome (32235244253223).
The spelling of 20112131132121 in words is "twenty trillion, one hundred twelve billion, one hundred thirty-one million, one hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •