Base | Representation |
---|---|
bin | 1010111100001111001… |
… | …1011111110111000001 |
3 | 122222011212011210222101 |
4 | 2233003303133313001 |
5 | 11034424433310224 |
6 | 222203540310401 |
7 | 16403016111601 |
oct | 2570363376701 |
9 | 588155153871 |
10 | 187968650689 |
11 | 72798448406 |
12 | 3051a3a2401 |
13 | 1495782c481 |
14 | 9152262c01 |
15 | 4d520b0044 |
hex | 2bc3cdfdc1 |
187968650689 has 4 divisors (see below), whose sum is σ = 189320943280. Its totient is φ = 186616358100.
The previous prime is 187968650687. The next prime is 187968650693. The reversal of 187968650689 is 986056869781.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 986056869781 = 313 ⋅3150341437.
It is a cyclic number.
It is not a de Polignac number, because 187968650689 - 21 = 187968650687 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (187968650687) 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 3 ways as a sum of consecutive naturals, for example, 676146087 + ... + 676146364.
It is an arithmetic number, because the mean of its divisors is an integer number (47330235820).
Almost surely, 2187968650689 is an apocalyptic number.
It is an amenable number.
187968650689 is a deficient number, since it is larger than the sum of its proper divisors (1352292591).
187968650689 is a wasteful number, since it uses less digits than its factorization.
187968650689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1352292590.
The product of its (nonzero) digits is 313528320, while the sum is 73.
The spelling of 187968650689 in words is "one hundred eighty-seven billion, nine hundred sixty-eight million, six hundred fifty thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •