Base | Representation |
---|---|
bin | 1011001001011011001… |
… | …1100110000101100011 |
3 | 200022022120100100212012 |
4 | 2302112303212011203 |
5 | 11114202204400041 |
6 | 223551115223135 |
7 | 16556522553200 |
oct | 2622663460543 |
9 | 608276310765 |
10 | 191508668771 |
11 | 74244718392 |
12 | 31147a47aab |
13 | 150a006a924 |
14 | 93aa47aca7 |
15 | 4eacc743eb |
hex | 2c96ce6163 |
191508668771 has 24 divisors (see below), whose sum is σ = 232004250000. Its totient is φ = 157426067904.
The previous prime is 191508668759. The next prime is 191508668831. The reversal of 191508668771 is 177866805191.
191508668771 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 191508668771 - 210 = 191508667747 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 191508668771.
It is not an unprimeable number, because it can be changed into a prime (191508662771) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 240521 + ... + 663978.
It is an arithmetic number, because the mean of its divisors is an integer number (9666843750).
Almost surely, 2191508668771 is an apocalyptic number.
191508668771 is a deficient number, since it is larger than the sum of its proper divisors (40495581229).
191508668771 is a wasteful number, since it uses less digits than its factorization.
191508668771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904691 (or 904684 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 59.
The spelling of 191508668771 in words is "one hundred ninety-one billion, five hundred eight million, six hundred sixty-eight thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •