Base | Representation |
---|---|
bin | 1001010010010111010110… |
… | …1001101000111000001001 |
3 | 1100011011122220000220211220 |
4 | 2110211311221220320021 |
5 | 2314244323421042301 |
6 | 33414530352512253 |
7 | 2102504565240366 |
oct | 224456551507011 |
9 | 40134586026756 |
10 | 10211111112201 |
11 | 328756502427a |
12 | 118ab9454b689 |
13 | 590b994066ac |
14 | 274312b6546d |
15 | 12a933aa3936 |
hex | 94975a68e09 |
10211111112201 has 16 divisors (see below), whose sum is σ = 13634456575104. Its totient is φ = 6797592418304.
The previous prime is 10211111112101. The next prime is 10211111112227. The reversal of 10211111112201 is 10221111111201.
It is a cyclic number.
It is not a de Polignac number, because 10211111112201 - 223 = 10211102723593 is a prime.
It is a super-2 number, since 2×102111111122012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10211111112101) 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, 6216265 + ... + 7685321.
It is an arithmetic number, because the mean of its divisors is an integer number (852153535944).
Almost surely, 210211111112201 is an apocalyptic number.
It is an amenable number.
10211111112201 is a deficient number, since it is larger than the sum of its proper divisors (3423345462903).
10211111112201 is a wasteful number, since it uses less digits than its factorization.
10211111112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1472400.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 10211111112201 its reverse (10221111111201), we get a palindrome (20432222223402).
It can be divided in two parts, 1021111 and 1112201, that added together give a palindrome (2133312).
The spelling of 10211111112201 in words is "ten trillion, two hundred eleven billion, one hundred eleven million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •