Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …01001010101100000111101 |
3 | 2122012111222221211101210022 |
4 | 10210221012221111200331 |
5 | 10113441213330333041 |
6 | 110434301500421525 |
7 | 4143626023421324 |
oct | 444510651254075 |
9 | 78174887741708 |
10 | 20110222121021 |
11 | 6453774129a3a |
12 | 23095b48478a5 |
13 | b2b5028118a6 |
14 | 4d74a8b410bb |
15 | 24d1a670724b |
hex | 124a46a5583d |
20110222121021 has 8 divisors (see below), whose sum is σ = 21294257644800. Its totient is φ = 18926306739648.
The previous prime is 20110222120939. The next prime is 20110222121039. The reversal of 20110222121021 is 12012122201102.
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 20110222121021 - 218 = 20110221858877 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110222121051) 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, 29690861 + ... + 30360626.
It is an arithmetic number, because the mean of its divisors is an integer number (2661782205600).
Almost surely, 220110222121021 is an apocalyptic number.
It is an amenable number.
20110222121021 is a deficient number, since it is larger than the sum of its proper divisors (1184035523779).
20110222121021 is a wasteful number, since it uses less digits than its factorization.
20110222121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60071203.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20110222121021 its reverse (12012122201102), we get a palindrome (32122344322123).
The spelling of 20110222121021 in words is "twenty trillion, one hundred ten billion, two hundred twenty-two million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •