Base | Representation |
---|---|
bin | 1001010001101101111111… |
… | …1110101011010100001100 |
3 | 1100010010000020112120221101 |
4 | 2110123133332223110030 |
5 | 2314104110042011340 |
6 | 33405453035512444 |
7 | 2101632521260210 |
oct | 224333776532414 |
9 | 40103006476841 |
10 | 10200010110220 |
11 | 3282888880177 |
12 | 11889b68b8724 |
13 | 58cb1a5a7478 |
14 | 27397c6c2940 |
15 | 12a4d4212c9a |
hex | 946dffab50c |
10200010110220 has 48 divisors (see below), whose sum is σ = 25768446600960. Its totient is φ = 3313085989824.
The previous prime is 10200010110203. The next prime is 10200010110233. The reversal of 10200010110220 is 2201101000201.
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 = 10200010110197 and 10200010110206.
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, 1917292474 + ... + 1917297793.
It is an arithmetic number, because the mean of its divisors is an integer number (536842637520).
Almost surely, 210200010110220 is an apocalyptic number.
10200010110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200010110220 is an abundant number, since it is smaller than the sum of its proper divisors (15568436490740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200010110220 is a wasteful number, since it uses less digits than its factorization.
10200010110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3834590302 (or 3834590300 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10200010110220 its reverse (2201101000201), we get a palindrome (12401111110421).
The spelling of 10200010110220 in words is "ten trillion, two hundred billion, ten million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •