Search a number
-
+
10051110551 = 29438060233
BaseRepresentation
bin10010101110001011…
…11100011010010111
3221221110221022121202
421113011330122113
5131041041014201
64341210103115
7504035013206
oct112705743227
927843838552
1010051110551
114298654139
121b4611aa9b
13c424741c1
146b4c6923d
153dc606c6b
hex25717c697

10051110551 has 8 divisors (see below), whose sum is σ = 10639508880. Its totient is φ = 9478832832.

The previous prime is 10051110547. The next prime is 10051110557. The reversal of 10051110551 is 15501115001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10051110551 - 22 = 10051110547 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 210051110551 is an apocalyptic number.

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

10051110551 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8060305.

The product of its (nonzero) digits is 125, while the sum is 20.

Adding to 10051110551 its reverse (15501115001), we get a palindrome (25552225552).

The spelling of 10051110551 in words is "ten billion, fifty-one million, one hundred ten thousand, five hundred fifty-one".

Divisors: 1 29 43 1247 8060233 233746757 346590019 10051110551