Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …000101110010011010100 |
3 | 10220100111200001222012010 |
4 | 100002111200232103110 |
5 | 121023414110324340 |
6 | 2202132213224220 |
7 | 142422040353042 |
oct | 20022540562324 |
9 | 3810450058163 |
10 | 1102020011220 |
11 | 395400626357 |
12 | 1596b4332070 |
13 | 7cbc643ab9b |
14 | 3b4a3891392 |
15 | 1d9eceb7b80 |
hex | 1009582e4d4 |
1102020011220 has 96 divisors (see below), whose sum is σ = 3216730438656. Its totient is φ = 281576448000.
The previous prime is 1102020011177. The next prime is 1102020011233. The reversal of 1102020011220 is 221100202011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1102020011196 and 1102020011205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2745229 + ... + 3120948.
It is an arithmetic number, because the mean of its divisors is an integer number (33507608736).
Almost surely, 21102020011220 is an apocalyptic number.
1102020011220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102020011220 is an abundant number, since it is smaller than the sum of its proper divisors (2114710427436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102020011220 is a wasteful number, since it uses less digits than its factorization.
1102020011220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5866321 (or 5866319 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1102020011220 its reverse (221100202011), we get a palindrome (1323120213231).
The spelling of 1102020011220 in words is "one trillion, one hundred two billion, twenty million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •