Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1001110100000101101010 |
3 | 1100010010020120202212100010 |
4 | 2110123211121310011222 |
5 | 2314104301341010442 |
6 | 33405510050152350 |
7 | 2101635004616100 |
oct | 224334531640552 |
9 | 40103216685303 |
10 | 10200101110122 |
11 | 3282925184800 |
12 | 1188a212826b6 |
13 | 58cb333b9571 |
14 | 27398a80dc70 |
15 | 12a4dc1dab9c |
hex | 946e567416a |
10200101110122 has 72 divisors (see below), whose sum is σ = 26084320049088. Its totient is φ = 2649376902480.
The previous prime is 10200101110081. The next prime is 10200101110139. The reversal of 10200101110122 is 22101110100201.
It is a super-3 number, since 3×102001011101223 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10200101110098 and 10200101110107.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 143328978 + ... + 143400125.
It is an arithmetic number, because the mean of its divisors is an integer number (362282222904).
Almost surely, 210200101110122 is an apocalyptic number.
10200101110122 is an abundant number, since it is smaller than the sum of its proper divisors (15884218938966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200101110122 is a wasteful number, since it uses less digits than its factorization.
10200101110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286729144 (or 286729126 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10200101110122 its reverse (22101110100201), we get a palindrome (32301211210323).
The spelling of 10200101110122 in words is "ten trillion, two hundred billion, one hundred one million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •