Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …00111111100100001000 |
3 | 10121201020121200001211212 |
4 | 32313322200333210020 |
5 | 113221240202431440 |
6 | 2101315000512252 |
7 | 133562562240500 |
oct | 16677240774410 |
9 | 3551217601755 |
10 | 1022110202120 |
11 | 364524621007 |
12 | 14611277b688 |
13 | 754ccbc3b87 |
14 | 37682ab2a00 |
15 | 1b8c28b2465 |
hex | edfa83f908 |
1022110202120 has 48 divisors (see below), whose sum is σ = 2675217013740. Its totient is φ = 350437782912.
The previous prime is 1022110202111. The next prime is 1022110202171. The reversal of 1022110202120 is 212020112201.
It can be written as a sum of positive squares in 2 ways, for example, as 1004721560164 + 17388641956 = 1002358^2 + 131866^2 .
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 = 1022110202095 and 1022110202104.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 260740439 + ... + 260744358.
Almost surely, 21022110202120 is an apocalyptic number.
1022110202120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022110202120 is an abundant number, since it is smaller than the sum of its proper divisors (1653106811620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022110202120 is a wasteful number, since it uses less digits than its factorization.
1022110202120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521484822 (or 521484811 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1022110202120 its reverse (212020112201), we get a palindrome (1234130314321).
The spelling of 1022110202120 in words is "one trillion, twenty-two billion, one hundred ten million, two hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •