Search a number
-
+
28110644951 = 191479507629
BaseRepresentation
bin11010001011100001…
…100110011011010111
32200120002010201111012
4122023201212123113
5430032311114301
620525220402435
72013415353044
oct321341463327
980502121435
1028110644951
1110a157a9684
12554624641b
13285cb1a82c
1415095521cb
15ae7d1eebb
hex68b8666d7

28110644951 has 4 divisors (see below), whose sum is σ = 29590152600. Its totient is φ = 26631137304.

The previous prime is 28110644909. The next prime is 28110644981. The reversal of 28110644951 is 15944601182.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-28110644951 is a prime.

It is a super-2 number, since 2×281106449512 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 28110644899 and 28110644908.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (28110644981) 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 3 ways as a sum of consecutive naturals, for example, 739753796 + ... + 739753833.

It is an arithmetic number, because the mean of its divisors is an integer number (7397538150).

Almost surely, 228110644951 is an apocalyptic number.

28110644951 is a deficient number, since it is larger than the sum of its proper divisors (1479507649).

28110644951 is a wasteful number, since it uses less digits than its factorization.

28110644951 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1479507648.

The product of its (nonzero) digits is 69120, while the sum is 41.

The spelling of 28110644951 in words is "twenty-eight billion, one hundred ten million, six hundred forty-four thousand, nine hundred fifty-one".

Divisors: 1 19 1479507629 28110644951