Base | Representation |
---|---|
bin | 1001010001101110101111… |
… | …1001001111001111110001 |
3 | 1100010010112011200121102110 |
4 | 2110123223321033033301 |
5 | 2314110012230323441 |
6 | 33405524540235533 |
7 | 2101640466352524 |
oct | 224335371171761 |
9 | 40103464617373 |
10 | 10200210011121 |
11 | 32829806a5729 |
12 | 1188a5183bba9 |
13 | 58cb4cb28620 |
14 | 27399b07abbb |
15 | 12a4e6a4cb16 |
hex | 946ebe4f3f1 |
10200210011121 has 32 divisors (see below), whose sum is σ = 14736476885760. Its totient is φ = 6238483513344.
The previous prime is 10200210011113. The next prime is 10200210011129. The reversal of 10200210011121 is 12111001200201.
It is an interprime number because it is at equal distance from previous prime (10200210011113) and next prime (10200210011129).
It is not a de Polignac number, because 10200210011121 - 23 = 10200210011113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200210011097 and 10200210011106.
It is not an unprimeable number, because it can be changed into a prime (10200210011129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42403441 + ... + 42643313.
It is an arithmetic number, because the mean of its divisors is an integer number (460514902680).
Almost surely, 210200210011121 is an apocalyptic number.
It is an amenable number.
10200210011121 is a deficient number, since it is larger than the sum of its proper divisors (4536266874639).
10200210011121 is a wasteful number, since it uses less digits than its factorization.
10200210011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246585.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10200210011121 its reverse (12111001200201), we get a palindrome (22311211211322).
The spelling of 10200210011121 in words is "ten trillion, two hundred billion, two hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •