Base | Representation |
---|---|
bin | 1001100110100000000111… |
… | …01000010010111010100100 |
3 | 2202202111020100000210101201 |
4 | 10303100003220102322210 |
5 | 10231413204222401040 |
6 | 112523405354532244 |
7 | 4306305402554632 |
oct | 463200350227244 |
9 | 82674210023351 |
10 | 21114120122020 |
11 | 68004a2401762 |
12 | 2450084137084 |
13 | ba208c5384a3 |
14 | 52dd00b4a352 |
15 | 269360296a9a |
hex | 133403a12ea4 |
21114120122020 has 12 divisors (see below), whose sum is σ = 44339652256284. Its totient is φ = 8445648048800.
The previous prime is 21114120122009. The next prime is 21114120122159. The reversal of 21114120122020 is 2022102141112.
It can be written as a sum of positive squares in 2 ways, for example, as 2418199163136 + 18695920958884 = 1555056^2 + 4323878^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 527853003031 + ... + 527853003070.
It is an arithmetic number, because the mean of its divisors is an integer number (3694971021357).
Almost surely, 221114120122020 is an apocalyptic number.
21114120122020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21114120122020 is an abundant number, since it is smaller than the sum of its proper divisors (23225532134264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21114120122020 is a wasteful number, since it uses less digits than its factorization.
21114120122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1055706006110 (or 1055706006108 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21114120122020 its reverse (2022102141112), we get a palindrome (23136222263132).
The spelling of 21114120122020 in words is "twenty-one trillion, one hundred fourteen billion, one hundred twenty million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •