Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11110111111110011000100 |
3 | 2122012111222011221111211012 |
4 | 10210221011332333303010 |
5 | 10113441203010201040 |
6 | 110434300422501352 |
7 | 4143625530163610 |
oct | 444510576776304 |
9 | 78174864844735 |
10 | 20110211022020 |
11 | 6453768939109 |
12 | 23095b0b94858 |
13 | b2b500426a32 |
14 | 4d74a7492340 |
15 | 24d1a5763865 |
hex | 124a45fbfcc4 |
20110211022020 has 48 divisors (see below), whose sum is σ = 48475268567040. Its totient is φ = 6864820619904.
The previous prime is 20110211022001. The next prime is 20110211022059. The reversal of 20110211022020 is 2022011201102.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 20110211021986 and 20110211022004.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 313601924 + ... + 313666043.
It is an arithmetic number, because the mean of its divisors is an integer number (1009901428480).
Almost surely, 220110211022020 is an apocalyptic number.
20110211022020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110211022020 is an abundant number, since it is smaller than the sum of its proper divisors (28365057545020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110211022020 is a wasteful number, since it uses less digits than its factorization.
20110211022020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 627268212 (or 627268210 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20110211022020 its reverse (2022011201102), we get a palindrome (22132222223122).
The spelling of 20110211022020 in words is "twenty trillion, one hundred ten billion, two hundred eleven million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •