Base | Representation |
---|---|
bin | 1001001100100000100100… |
… | …01000000001010110001001 |
3 | 2122121002221221222222110022 |
4 | 10212100102020001112021 |
5 | 10122300112042401441 |
6 | 111001223120030225 |
7 | 4154630324042144 |
oct | 446202210012611 |
9 | 78532857888408 |
10 | 20221010122121 |
11 | 6496756064a26 |
12 | 2326b73462375 |
13 | b38aaa350023 |
14 | 4dc9b884905b |
15 | 250edcaa684b |
hex | 126412201589 |
20221010122121 has 8 divisors (see below), whose sum is σ = 20297212665120. Its totient is φ = 20144841031872.
The previous prime is 20221010122087. The next prime is 20221010122171. The reversal of 20221010122121 is 12122101012202.
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 20221010122121 - 234 = 20203830252937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20221010122121.
It is not an unprimeable number, because it can be changed into a prime (20221010122171) 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, 7151651 + ... + 9570168.
It is an arithmetic number, because the mean of its divisors is an integer number (2537151583140).
Almost surely, 220221010122121 is an apocalyptic number.
It is an amenable number.
20221010122121 is a deficient number, since it is larger than the sum of its proper divisors (76202542999).
20221010122121 is a wasteful number, since it uses less digits than its factorization.
20221010122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16726375.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20221010122121 its reverse (12122101012202), we get a palindrome (32343111134323).
The spelling of 20221010122121 in words is "twenty trillion, two hundred twenty-one billion, ten million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •