Base | Representation |
---|---|
bin | 1001010001101110101101… |
… | …0011000011011001100000 |
3 | 1100010010111110212001021200 |
4 | 2110123223103003121200 |
5 | 2314110002200013440 |
6 | 33405523541521200 |
7 | 2101640315312043 |
oct | 224335323033140 |
9 | 40103443761250 |
10 | 10200200001120 |
11 | 3282975a88aa8 |
12 | 1188a4a413200 |
13 | 58cb4aa3234c |
14 | 2739999d2c5a |
15 | 12a4e5c21c30 |
hex | 946eb4c3660 |
10200200001120 has 72 divisors (see below), whose sum is σ = 34808182508736. Its totient is φ = 2720053333248.
The previous prime is 10200200001077. The next prime is 10200200001139. The reversal of 10200200001120 is 2110000200201.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 3541734672 + ... + 3541737551.
It is an arithmetic number, because the mean of its divisors is an integer number (483446979288).
Almost surely, 210200200001120 is an apocalyptic number.
10200200001120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200200001120 is an abundant number, since it is smaller than the sum of its proper divisors (24607982507616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200200001120 is a wasteful number, since it uses less digits than its factorization.
10200200001120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7083472244 (or 7083472233 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10200200001120 its reverse (2110000200201), we get a palindrome (12310200201321).
The spelling of 10200200001120 in words is "ten trillion, two hundred billion, two hundred million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •