Search a number
-
+
10550656615 = 52110131323
BaseRepresentation
bin10011101001101111…
…00011111001100111
31000020021220212222211
421310313203321213
5133101432002430
64502533104251
7522312046552
oct116467437147
930207825884
1010550656615
114524630524
122065488087
13cc1aca7a5
14721343699
1541b3d072a
hex274de3e67

10550656615 has 4 divisors (see below), whose sum is σ = 12660787944. Its totient is φ = 8440525288.

The previous prime is 10550656583. The next prime is 10550656621. The reversal of 10550656615 is 51665605501.

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

It is a cyclic number.

It is not a de Polignac number, because 10550656615 - 25 = 10550656583 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 210550656615 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2110131328.

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 10550656615 in words is "ten billion, five hundred fifty million, six hundred fifty-six thousand, six hundred fifteen".

Divisors: 1 5 2110131323 10550656615