Base | Representation |
---|---|
bin | 1001001100001110000111… |
… | …00011100101001011011001 |
3 | 2122120011101110010211201021 |
4 | 10212013003203211023121 |
5 | 10122114314103341441 |
6 | 110552504014522441 |
7 | 4154126643354106 |
oct | 446070343451331 |
9 | 78504343124637 |
10 | 20211102012121 |
11 | 6492531202269 |
12 | 2325069206421 |
13 | b37b8b6c6b47 |
14 | 4dc3189a5aad |
15 | 250b0ccea3d1 |
hex | 1261c38e52d9 |
20211102012121 has 8 divisors (see below), whose sum is σ = 20221117862400. Its totient is φ = 20201087049360.
The previous prime is 20211102012113. The next prime is 20211102012209. The reversal of 20211102012121 is 12121020111202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20211102012121 - 23 = 20211102012113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20211102012095 and 20211102012104.
It is not an unprimeable number, because it can be changed into a prime (20211102012221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47908335 + ... + 48328363.
It is an arithmetic number, because the mean of its divisors is an integer number (2527639732800).
Almost surely, 220211102012121 is an apocalyptic number.
It is an amenable number.
20211102012121 is a deficient number, since it is larger than the sum of its proper divisors (10015850279).
20211102012121 is a wasteful number, since it uses less digits than its factorization.
20211102012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443759.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20211102012121 its reverse (12121020111202), we get a palindrome (32332122123323).
The spelling of 20211102012121 in words is "twenty trillion, two hundred eleven billion, one hundred two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •