Search a number
-
+
10115115655 = 52023023131
BaseRepresentation
bin10010110101110100…
…00110101010000111
3222002221101010010011
421122322012222013
5131203432200110
64351414011051
7505443031051
oct113272065207
928087333104
1010115115655
1143207a0117
121b63646a87
13c527c4148
146bd56a8d1
153e304b48a
hex25ae86a87

10115115655 has 4 divisors (see below), whose sum is σ = 12138138792. Its totient is φ = 8092092520.

The previous prime is 10115115653. The next prime is 10115115683. The reversal of 10115115655 is 55651151101.

10115115655 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 10115115655 - 21 = 10115115653 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 (10115115653) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210115115655 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2023023136.

The product of its (nonzero) digits is 3750, while the sum is 31.

Adding to 10115115655 its reverse (55651151101), we get a palindrome (65766266756).

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

Divisors: 1 5 2023023131 10115115655