Search a number
-
+
110006101051 = 7112129877333
BaseRepresentation
bin110011001110011011…
…1111110010000111011
3101111221111212221102221
41212130313332100323
53300243030213201
6122311444304511
710643024300530
oct1463467762073
9344844787387
10110006101051
1142720637a00
12193a09a2137
13a4b1854bb2
145477d30d87
152cdc9004a1
hex199cdfe43b

110006101051 has 12 divisors (see below), whose sum is σ = 138189483376. Its totient is φ = 85719039120.

The previous prime is 110006101003. The next prime is 110006101063. The reversal of 110006101051 is 150101600011.

It is not a de Polignac number, because 110006101051 - 211 = 110006099003 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 64937820 + ... + 64939513.

Almost surely, 2110006101051 is an apocalyptic number.

110006101051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 129877362 (or 129877351 counting only the distinct ones).

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

Adding to 110006101051 its reverse (150101600011), we get a palindrome (260107701062).

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

Divisors: 1 7 11 77 121 847 129877333 909141331 1428650663 10000554641 15715157293 110006101051