Base | Representation |
---|---|
bin | 1100010010101000011… |
… | …1111010111111010111 |
3 | 202012001010000101020202 |
4 | 3010222013322333113 |
5 | 11424423442222312 |
6 | 241001114051115 |
7 | 21153513244604 |
oct | 3045207727727 |
9 | 665033011222 |
10 | 211160117207 |
11 | 81609421466 |
12 | 34b11119a9b |
13 | 16bb2478720 |
14 | a3123516ab |
15 | 575d0e09c2 |
hex | 312a1fafd7 |
211160117207 has 8 divisors (see below), whose sum is σ = 227412487680. Its totient is φ = 194909073120.
The previous prime is 211160117191. The next prime is 211160117209. The reversal of 211160117207 is 702711061112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211160117207 - 24 = 211160117191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 211160117207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211160117209) 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 7 ways as a sum of consecutive naturals, for example, 12269 + ... + 649977.
It is an arithmetic number, because the mean of its divisors is an integer number (28426560960).
Almost surely, 2211160117207 is an apocalyptic number.
211160117207 is a deficient number, since it is larger than the sum of its proper divisors (16252370473).
211160117207 is a wasteful number, since it uses less digits than its factorization.
211160117207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663193.
The product of its (nonzero) digits is 1176, while the sum is 29.
Adding to 211160117207 its reverse (702711061112), we get a palindrome (913871178319).
The spelling of 211160117207 in words is "two hundred eleven billion, one hundred sixty million, one hundred seventeen thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •