Base | Representation |
---|---|
bin | 1001010010010111011000… |
… | …1111110010000010100001 |
3 | 1100011011200120211220220020 |
4 | 2110211312033302002201 |
5 | 2314244334001024301 |
6 | 33414531351104053 |
7 | 2102505046234113 |
oct | 224456617620241 |
9 | 40134616756806 |
10 | 10211121111201 |
11 | 328756a73370a |
12 | 118ab97972029 |
13 | 590b9b4c796a |
14 | 2743142093b3 |
15 | 12a9348cb436 |
hex | 949763f20a1 |
10211121111201 has 16 divisors (see below), whose sum is σ = 14039500560384. Its totient is φ = 6597890268624.
The previous prime is 10211121111161. The next prime is 10211121111209. The reversal of 10211121111201 is 10211112111201.
It is not a de Polignac number, because 10211121111201 - 29 = 10211121110689 is a prime.
It is a super-2 number, since 2×102111211112012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10211121111209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 351535471 + ... + 351564516.
It is an arithmetic number, because the mean of its divisors is an integer number (877468785024).
Almost surely, 210211121111201 is an apocalyptic number.
It is an amenable number.
10211121111201 is a deficient number, since it is larger than the sum of its proper divisors (3828379449183).
10211121111201 is a wasteful number, since it uses less digits than its factorization.
10211121111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703100140.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 10211121111201 its reverse (10211112111201), we get a palindrome (20422233222402).
Subtracting from 10211121111201 its reverse (10211112111201), we obtain a square (9000000 = 30002).
The spelling of 10211121111201 in words is "ten trillion, two hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •