Base | Representation |
---|---|
bin | 110000000001010111011011… |
… | …100010000111011110001011 |
3 | 1000200210112101210120000000201 |
4 | 300001113123202013132023 |
5 | 210140300311130000021 |
6 | 2025103554024513031 |
7 | 62325463416446656 |
oct | 6001273342073613 |
9 | 1020715353500021 |
10 | 211200110000011 |
11 | 61327511135060 |
12 | 1b82bbb561b777 |
13 | 90b0114737462 |
14 | 3a221d5b1289d |
15 | 1963bed69a591 |
hex | c015db88778b |
211200110000011 has 4 divisors (see below), whose sum is σ = 230400120000024. Its totient is φ = 192000100000000.
The previous prime is 211200109999981. The next prime is 211200110000017. The reversal of 211200110000011 is 110000011002112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211200110000011 - 223 = 211200101611403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211200110000017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9600004999990 + ... + 9600005000011.
It is an arithmetic number, because the mean of its divisors is an integer number (57600030000006).
Almost surely, 2211200110000011 is an apocalyptic number.
211200110000011 is a deficient number, since it is larger than the sum of its proper divisors (19200010000013).
211200110000011 is a wasteful number, since it uses less digits than its factorization.
211200110000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19200010000012.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211200110000011 its reverse (110000011002112), we get a palindrome (321200121002123).
The spelling of 211200110000011 in words is "two hundred eleven trillion, two hundred billion, one hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •