Base | Representation |
---|---|
bin | 1001001001101000001010… |
… | …10101000110101000010101 |
3 | 2122020122102120001122220212 |
4 | 10210310011111012220111 |
5 | 10114134334331400041 |
6 | 110443531353335205 |
7 | 4144524124064123 |
oct | 444640525065025 |
9 | 78218376048825 |
10 | 20122011200021 |
11 | 6458773819535 |
12 | 230b944a07505 |
13 | b2c661067293 |
14 | 4d7ca6736913 |
15 | 24d6466b28eb |
hex | 124d05546a15 |
20122011200021 has 8 divisors (see below), whose sum is σ = 20405645395200. Its totient is φ = 19838383271280.
The previous prime is 20122011199921. The next prime is 20122011200089. The reversal of 20122011200021 is 12000211022102.
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 20122011200021 - 242 = 15723964688917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122011199969 and 20122011200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122011200321) 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, 5099300 + ... + 8139218.
It is an arithmetic number, because the mean of its divisors is an integer number (2550705674400).
Almost surely, 220122011200021 is an apocalyptic number.
It is an amenable number.
20122011200021 is a deficient number, since it is larger than the sum of its proper divisors (283634195179).
20122011200021 is an equidigital number, since it uses as much as digits as its factorization.
20122011200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3133219.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20122011200021 its reverse (12000211022102), we get a palindrome (32122222222123).
The spelling of 20122011200021 in words is "twenty trillion, one hundred twenty-two billion, eleven million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •