Base | Representation |
---|---|
bin | 101111110001010111111010… |
… | …000110000011111000100001 |
3 | 1000112220110200200020221200012 |
4 | 233301113322012003320201 |
5 | 210014244033421024301 |
6 | 2022503041252334305 |
7 | 62153206252151642 |
oct | 5761277206037041 |
9 | 1015813620227605 |
10 | 210101111111201 |
11 | 60a43420996792 |
12 | 1b693005014395 |
13 | 90305b019808b |
14 | 39c4d3b5a56c9 |
15 | 194532aa49ebb |
hex | bf15fa183e21 |
210101111111201 has 16 divisors (see below), whose sum is σ = 224287107788160. Its totient is φ = 196228246959360.
The previous prime is 210101111111183. The next prime is 210101111111237. The reversal of 210101111111201 is 102111111101012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210101111111201 is a prime.
It is a super-2 number, since 2×2101011111112012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (210101111111501) 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, 18541385 + ... + 27640281.
It is an arithmetic number, because the mean of its divisors is an integer number (14017944236760).
Almost surely, 2210101111111201 is an apocalyptic number.
It is an amenable number.
210101111111201 is a deficient number, since it is larger than the sum of its proper divisors (14185996676959).
210101111111201 is a wasteful number, since it uses less digits than its factorization.
210101111111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9116104.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 210101111111201 its reverse (102111111101012), we get a palindrome (312212222212213).
The spelling of 210101111111201 in words is "two hundred ten trillion, one hundred one billion, one hundred eleven million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •