Base | Representation |
---|---|
bin | 101111101111111001110110… |
… | …000001010000010110000001 |
3 | 1000112112210222210202021010202 |
4 | 233233321312001100112001 |
5 | 210011120211404324301 |
6 | 2022344415201534545 |
7 | 62143002342365000 |
oct | 5757716601202601 |
9 | 1015483883667122 |
10 | 210000111011201 |
11 | 60a04601a79765 |
12 | 1b677518344455 |
13 | 9023c05414ab4 |
14 | 39c00b97acc37 |
15 | 19428b8b0e66b |
hex | befe76050581 |
210000111011201 has 8 divisors (see below), whose sum is σ = 244898088643200. Its totient is φ = 180000095152164.
The previous prime is 210000111011083. The next prime is 210000111011233. The reversal of 210000111011201 is 102110111000012.
210000111011201 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 210000111011201 - 246 = 139631366833537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210000111011261) 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, 306122610461 + ... + 306122611146.
It is an arithmetic number, because the mean of its divisors is an integer number (30612261080400).
Almost surely, 2210000111011201 is an apocalyptic number.
It is an amenable number.
210000111011201 is a deficient number, since it is larger than the sum of its proper divisors (34897977631999).
210000111011201 is an frugal number, since it uses more digits than its factorization.
210000111011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612245221628 (or 612245221614 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 210000111011201 its reverse (102110111000012), we get a palindrome (312110222011213).
The spelling of 210000111011201 in words is "two hundred ten trillion, one hundred eleven million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •