Base | Representation |
---|---|
bin | 1001000110000101101001… |
… | …1111111111001111001011 |
3 | 1022102000021021201002002200 |
4 | 2101201122133333033023 |
5 | 2302320403230400021 |
6 | 33134010210531243 |
7 | 2051330222123562 |
oct | 221413237771713 |
9 | 38360237632080 |
10 | 10000202200011 |
11 | 3206075489971 |
12 | 1156133596b23 |
13 | 577027002cba |
14 | 268025d24bd9 |
15 | 1251dca84126 |
hex | 9185a7ff3cb |
10000202200011 has 24 divisors (see below), whose sum is σ = 14503232103360. Its totient is φ = 6639848248176.
The previous prime is 10000202200007. The next prime is 10000202200013. The reversal of 10000202200011 is 11000220200001.
It is not a de Polignac number, because 10000202200011 - 22 = 10000202200007 is a prime.
It is a super-2 number, since 2×100002022000112 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10000202199966 and 10000202200002.
It is not an unprimeable number, because it can be changed into a prime (10000202200013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 818796 + ... + 4546518.
It is an arithmetic number, because the mean of its divisors is an integer number (604301337640).
Almost surely, 210000202200011 is an apocalyptic number.
10000202200011 is a deficient number, since it is larger than the sum of its proper divisors (4503029903349).
10000202200011 is a wasteful number, since it uses less digits than its factorization.
10000202200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3728935 (or 3728932 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10000202200011 its reverse (11000220200001), we get a palindrome (21000422400012).
The spelling of 10000202200011 in words is "ten trillion, two hundred two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •