Base | Representation |
---|---|
bin | 1100010011100000001… |
… | …0101010001111000111 |
3 | 202012122101101111100010 |
4 | 3010320002222033013 |
5 | 11430413231301022 |
6 | 241040214521303 |
7 | 21162350053533 |
oct | 3047002521707 |
9 | 665571344303 |
10 | 211393618887 |
11 | 81719206760 |
12 | 34b77366233 |
13 | 16c1b9627b9 |
14 | a335374bc3 |
15 | 577386650c |
hex | 31380aa3c7 |
211393618887 has 48 divisors (see below), whose sum is σ = 321376809600. Its totient is φ = 122540376960.
The previous prime is 211393618871. The next prime is 211393618901. The reversal of 211393618887 is 788816393112.
It is a happy number.
It is not a de Polignac number, because 211393618887 - 24 = 211393618871 is a prime.
It is a super-2 number, since 2×2113936188872 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (57) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211393618687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2625789 + ... + 2705097.
It is an arithmetic number, because the mean of its divisors is an integer number (6695350200).
Almost surely, 2211393618887 is an apocalyptic number.
211393618887 is a deficient number, since it is larger than the sum of its proper divisors (109983190713).
211393618887 is a wasteful number, since it uses less digits than its factorization.
211393618887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79456 (or 79419 counting only the distinct ones).
The product of its digits is 3483648, while the sum is 57.
The spelling of 211393618887 in words is "two hundred eleven billion, three hundred ninety-three million, six hundred eighteen thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •