Base | Representation |
---|---|
bin | 101111110001011000000000… |
… | …000011100001101001111011 |
3 | 1000112220110221122102102020211 |
4 | 233301120000003201221323 |
5 | 210014244240021010021 |
6 | 2022503055223531551 |
7 | 62153211605140444 |
oct | 5761300003415173 |
9 | 1015813848372224 |
10 | 210101211110011 |
11 | 60a43472387331 |
12 | 1b6930325b9bb7 |
13 | 90305c7b0b180 |
14 | 39c4d4a9962cb |
15 | 19453346ee3e1 |
hex | bf16000e1a7b |
210101211110011 has 16 divisors (see below), whose sum is σ = 237171714927840. Its totient is φ = 184809128474880.
The previous prime is 210101211109991. The next prime is 210101211110033. The reversal of 210101211110011 is 110011112101012.
It is not a de Polignac number, because 210101211110011 - 237 = 209963772156539 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210101211109973 and 210101211110000.
It is not an unprimeable number, because it can be changed into a prime (210101211110051) 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, 4583536816 + ... + 4583582653.
It is an arithmetic number, because the mean of its divisors is an integer number (14823232182990).
Almost surely, 2210101211110011 is an apocalyptic number.
210101211110011 is a deficient number, since it is larger than the sum of its proper divisors (27070503817829).
210101211110011 is a wasteful number, since it uses less digits than its factorization.
210101211110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9167119566.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 210101211110011 its reverse (110011112101012), we get a palindrome (320112323211023).
The spelling of 210101211110011 in words is "two hundred ten trillion, one hundred one billion, two hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •