Base | Representation |
---|---|
bin | 11101101100000101011… |
… | …01011100011100011100 |
3 | 10121112001112111101121001 |
4 | 32312002231130130130 |
5 | 113203131122401340 |
6 | 2100343315320044 |
7 | 133462014430603 |
oct | 16660255343434 |
9 | 3545045441531 |
10 | 1020100200220 |
11 | 363692a72912 |
12 | 1458515b0024 |
13 | 7526c65713a |
14 | 37531b72a3a |
15 | 1b8061c629a |
hex | ed82b5c71c |
1020100200220 has 12 divisors (see below), whose sum is σ = 2142210420504. Its totient is φ = 408040080080.
The previous prime is 1020100200181. The next prime is 1020100200299. The reversal of 1020100200220 is 220020010201.
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 = 1020100200197 and 1020100200206.
It is a congruent number.
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, 25502504986 + ... + 25502505025.
It is an arithmetic number, because the mean of its divisors is an integer number (178517535042).
Almost surely, 21020100200220 is an apocalyptic number.
1020100200220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020100200220 is an abundant number, since it is smaller than the sum of its proper divisors (1122110220284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020100200220 is a wasteful number, since it uses less digits than its factorization.
1020100200220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51005010020 (or 51005010018 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 1020100200220 its reverse (220020010201), we get a palindrome (1240120210421).
The spelling of 1020100200220 in words is "one trillion, twenty billion, one hundred million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •