Base | Representation |
---|---|
bin | 11101101111101001000… |
… | …10110010110110001100 |
3 | 10121200222122010211111101 |
4 | 32313310202302312030 |
5 | 113221034030323040 |
6 | 2101301021232444 |
7 | 133560234521245 |
oct | 16676442626614 |
9 | 3550878124441 |
10 | 1022010011020 |
11 | 364483009a49 |
12 | 1460a5102724 |
13 | 754b52143bb |
14 | 37673671ccc |
15 | 1b8b8bc109a |
hex | edf48b2d8c |
1022010011020 has 48 divisors (see below), whose sum is σ = 2259279187200. Its totient is φ = 387271005120.
The previous prime is 1022010011017. The next prime is 1022010011021. The reversal of 1022010011020 is 201100102201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1022010010988 and 1022010011006.
It is not an unprimeable number, because it can be changed into a prime (1022010011021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11675215 + ... + 11762425.
It is an arithmetic number, because the mean of its divisors is an integer number (47068316400).
Almost surely, 21022010011020 is an apocalyptic number.
1022010011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022010011020 is an abundant number, since it is smaller than the sum of its proper divisors (1237269176180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022010011020 is a wasteful number, since it uses less digits than its factorization.
1022010011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118078 (or 118076 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1022010011020 its reverse (201100102201), we get a palindrome (1223110113221).
The spelling of 1022010011020 in words is "one trillion, twenty-two billion, ten million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •