Base | Representation |
---|---|
bin | 101111111111111011001000… |
… | …110001011011101011001011 |
3 | 1000200110001121102022012102101 |
4 | 233333323020301123223023 |
5 | 210132134332304000021 |
6 | 2024550244325214231 |
7 | 62315354563033426 |
oct | 5777731061335313 |
9 | 1020401542265371 |
10 | 211101011000011 |
11 | 61299488354660 |
12 | 1b814959561377 |
13 | 90a39807b1612 |
14 | 3a1b4b45cc9bd |
15 | 196134d5d8a91 |
hex | bffec8c5bacb |
211101011000011 has 4 divisors (see below), whose sum is σ = 230292012000024. Its totient is φ = 191910010000000.
The previous prime is 211101010999979. The next prime is 211101011000081. The reversal of 211101011000011 is 110000110101112.
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 211101011000011 - 25 = 211101010999979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211101011000081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9595500499990 + ... + 9595500500011.
It is an arithmetic number, because the mean of its divisors is an integer number (57573003000006).
Almost surely, 2211101011000011 is an apocalyptic number.
211101011000011 is a deficient number, since it is larger than the sum of its proper divisors (19191001000013).
211101011000011 is a wasteful number, since it uses less digits than its factorization.
211101011000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19191001000012.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 211101011000011 its reverse (110000110101112), we get a palindrome (321101121101123).
The spelling of 211101011000011 in words is "two hundred eleven trillion, one hundred one billion, eleven million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •