Base | Representation |
---|---|
bin | 1001100011001100010010… |
… | …1110100010100110010101 |
3 | 1101011210212000220210220111 |
4 | 2120303010232202212111 |
5 | 2334013402323343401 |
6 | 34155420420003021 |
7 | 2132420521344253 |
oct | 230630456424625 |
9 | 41153760823814 |
10 | 10500200606101 |
11 | 3389123558888 |
12 | 1217013b30471 |
13 | 5b221aa1341b |
14 | 2842d8c515d3 |
15 | 13320349ee51 |
hex | 98cc4ba2995 |
10500200606101 has 8 divisors (see below), whose sum is σ = 10867743220320. Its totient is φ = 10133022440688.
The previous prime is 10500200606083. The next prime is 10500200606171. The reversal of 10500200606101 is 10160600200501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10500200606101 - 235 = 10465840867733 is a prime.
It is a super-2 number, since 2×105002006061012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10500200606171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91053571 + ... + 91168816.
It is an arithmetic number, because the mean of its divisors is an integer number (1358467902540).
Almost surely, 210500200606101 is an apocalyptic number.
It is an amenable number.
10500200606101 is a deficient number, since it is larger than the sum of its proper divisors (367542614219).
10500200606101 is a wasteful number, since it uses less digits than its factorization.
10500200606101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182224403.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 10500200606101 its reverse (10160600200501), we get a palindrome (20660800806602).
The spelling of 10500200606101 in words is "ten trillion, five hundred billion, two hundred million, six hundred six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •