Search a number
-
+
10700151121 = 112751117751
BaseRepresentation
bin10011111011100011…
…10101100101010001
31000121201012222220101
421331301311211101
5133403214313441
64525433212401
7526105532602
oct117561654521
930551188811
1010700151121
1145a0a57a00
1220a7561101
131016a8058a
14737139da9
154295b0231
hex27dc75951

10700151121 has 12 divisors (see below), whose sum is σ = 11777084032. Its totient is φ = 9714375000.

The previous prime is 10700151109. The next prime is 10700151151. The reversal of 10700151121 is 12115100701.

It is not a de Polignac number, because 10700151121 - 211 = 10700149073 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 210700151121 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 70, while the sum is 19.

Adding to 10700151121 its reverse (12115100701), we get a palindrome (22815251822).

The spelling of 10700151121 in words is "ten billion, seven hundred million, one hundred fifty-one thousand, one hundred twenty-one".

Divisors: 1 11 121 751 8261 90871 117751 1295261 14247871 88431001 972741011 10700151121