Base | Representation |
---|---|
bin | 101111110000000100000101… |
… | …000101011111111011101111 |
3 | 1000112120212100201201201002110 |
4 | 233300010011011133323233 |
5 | 210011310213401400421 |
6 | 2022353433515455103 |
7 | 62143541602426041 |
oct | 5760040505377357 |
9 | 1015525321651073 |
10 | 210011101200111 |
11 | 60a09231716312 |
12 | 1b679684a57493 |
13 | 9024c672b5863 |
14 | 39c083d247a91 |
15 | 1942d0d8b1a76 |
hex | bf010515feef |
210011101200111 has 8 divisors (see below), whose sum is σ = 286526773730560. Its totient is φ = 136751414734872.
The previous prime is 210011101200101. The next prime is 210011101200167. The reversal of 210011101200111 is 111002101110012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210011101200111 - 27 = 210011101199983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210011101200101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 813996516151 + ... + 813996516408.
It is an arithmetic number, because the mean of its divisors is an integer number (35815846716320).
Almost surely, 2210011101200111 is an apocalyptic number.
210011101200111 is a deficient number, since it is larger than the sum of its proper divisors (76515672530449).
210011101200111 is a wasteful number, since it uses less digits than its factorization.
210011101200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1627993032605.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 210011101200111 its reverse (111002101110012), we get a palindrome (321013202310123).
Subtracting from 210011101200111 its reverse (111002101110012), we obtain a palindrome (99009000090099).
The spelling of 210011101200111 in words is "two hundred ten trillion, eleven billion, one hundred one million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •