Search a number
-
+
10556051051 = 713116000561
BaseRepresentation
bin10011101010011000…
…01000111001101011
31000020200001221202202
421311030020321223
5133104322113201
64503244450415
7522405645020
oct116514107153
930220057682
1010556051051
114527685437
122067249a0b
13cc2c68c70
14721d49547
1541bae8c6b
hex275308e6b

10556051051 has 8 divisors (see below), whose sum is σ = 12992062944. Its totient is φ = 8352040320.

The previous prime is 10556051041. The next prime is 10556051113. The reversal of 10556051051 is 15015065501.

It is a happy number.

10556051051 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 not a de Polignac number, because 10556051051 - 218 = 10555788907 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10556051041) 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, 58000190 + ... + 58000371.

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

Almost surely, 210556051051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 116000581.

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

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

Divisors: 1 7 13 91 116000561 812003927 1508007293 10556051051