Search a number
-
+
10506626551 = 42227248813
BaseRepresentation
bin10011100100011111…
…00110010111110111
31000010020001221002201
421302033212113313
5133004144022201
64454321245331
7521235565201
oct116217462767
930106057081
1010506626551
114501798043
122052793847
13cb59527b5
14719561771
154175d4801
hex2723e65f7

10506626551 has 4 divisors (see below), whose sum is σ = 10506917592. Its totient is φ = 10506335512.

The previous prime is 10506626531. The next prime is 10506626623. The reversal of 10506626551 is 15562660501.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15562660501 = 83918549059.

It is a cyclic number.

It is not a de Polignac number, because 10506626551 - 213 = 10506618359 is a prime.

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

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 10506626551.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10506626531) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82180 + ... + 166633.

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

Almost surely, 210506626551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 291040.

The product of its (nonzero) digits is 54000, while the sum is 37.

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

Divisors: 1 42227 248813 10506626551