Base | Representation |
---|---|
bin | 101111110001100001001101… |
… | …100110010100001010011011 |
3 | 1000112221102110221220012022110 |
4 | 233301201031212110022123 |
5 | 210014430014103310021 |
6 | 2022511412512123403 |
7 | 62154011656326546 |
oct | 5761411546241233 |
9 | 1015842427805273 |
10 | 210111102010011 |
11 | 60a47688554954 |
12 | 1b694b32b36563 |
13 | 9031513019b17 |
14 | 39c560843985d |
15 | 1945712c0b476 |
hex | bf184d99429b |
210111102010011 has 16 divisors (see below), whose sum is σ = 287723416663584. Its totient is φ = 136286525297664.
The previous prime is 210111102009959. The next prime is 210111102010049. The reversal of 210111102010011 is 110010201111012.
210111102010011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210111102010011 - 215 = 210111101977243 is a prime.
It is a super-2 number, since 2×2101111020100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210111102015011) 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, 3525846 + ... + 20800331.
It is an arithmetic number, because the mean of its divisors is an integer number (17982713541474).
Almost surely, 2210111102010011 is an apocalyptic number.
210111102010011 is a deficient number, since it is larger than the sum of its proper divisors (77612314653573).
210111102010011 is a wasteful number, since it uses less digits than its factorization.
210111102010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24404030.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 210111102010011 its reverse (110010201111012), we get a palindrome (320121303121023).
The spelling of 210111102010011 in words is "two hundred ten trillion, one hundred eleven billion, one hundred two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •