Search a number
-
+
10101110551 = 710913238677
BaseRepresentation
bin10010110100001001…
…01011011100010111
3222001222000120201121
421122010223130113
5131141341014201
64350153504411
7505213010620
oct113204533427
928058016647
1010101110551
1143138a4954
121b5aa12107
13c4c92c5bc
146bb762a47
153e1bd19a1
hex25a12b717

10101110551 has 8 divisors (see below), whose sum is σ = 11650036640. Its totient is φ = 8578662048.

The previous prime is 10101110527. The next prime is 10101110563. The reversal of 10101110551 is 15501110101.

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

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 10101110551 - 29 = 10101110039 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 (10101110501) 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 7 ways as a sum of consecutive naturals, for example, 6618576 + ... + 6620101.

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

Almost surely, 210101110551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13238793.

The product of its (nonzero) digits is 25, while the sum is 16.

Adding to 10101110551 its reverse (15501110101), we get a palindrome (25602220652).

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

Divisors: 1 7 109 763 13238677 92670739 1443015793 10101110551