Search a number
-
+
10111009971 = 33370336657
BaseRepresentation
bin10010110101010100…
…11100010010110011
3222002122122112011210
421122222130102303
5131201404304341
64351150011203
7505363111116
oct113252342263
928078575153
1010111009971
114319446497
121b621a6b03
13c519b744a
146bcbbc57d
153e29d9c16
hex25aa9c4b3

10111009971 has 4 divisors (see below), whose sum is σ = 13481346632. Its totient is φ = 6740673312.

The previous prime is 10111009939. The next prime is 10111009973. The reversal of 10111009971 is 17990011101.

10111009971 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 10111009971 - 25 = 10111009939 is a prime.

It is a super-2 number, since 2×101110099712 (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 (10111009973) 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, 1685168326 + ... + 1685168331.

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

Almost surely, 210111009971 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3370336660.

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

The spelling of 10111009971 in words is "ten billion, one hundred eleven million, nine thousand, nine hundred seventy-one".

Divisors: 1 3 3370336657 10111009971