Base | Representation |
---|---|
bin | 1100010010010100001… |
… | …1111101010010011101 |
3 | 202011211012012201201102 |
4 | 3010211003331102131 |
5 | 11424240222120330 |
6 | 240544441522445 |
7 | 21151432346261 |
oct | 3044503752235 |
9 | 664735181642 |
10 | 211075191965 |
11 | 81575496910 |
12 | 34aa87a3425 |
13 | 16b9a9b25c1 |
14 | a304d660a1 |
15 | 5755917945 |
hex | 31250fd49d |
211075191965 has 8 divisors (see below), whose sum is σ = 276316615008. Its totient is φ = 153509230480.
The previous prime is 211075191907. The next prime is 211075191997. The reversal of 211075191965 is 569191570112.
211075191965 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211075191965 - 210 = 211075190941 is a prime.
It is a super-2 number, since 2×2110751919652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1918865327 + ... + 1918865436.
It is an arithmetic number, because the mean of its divisors is an integer number (34539576876).
Almost surely, 2211075191965 is an apocalyptic number.
It is an amenable number.
211075191965 is a deficient number, since it is larger than the sum of its proper divisors (65241423043).
211075191965 is a wasteful number, since it uses less digits than its factorization.
211075191965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3837730779.
The product of its (nonzero) digits is 170100, while the sum is 47.
The spelling of 211075191965 in words is "two hundred eleven billion, seventy-five million, one hundred ninety-one thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •