Search a number
-
+
11010012001 = 83132650747
BaseRepresentation
bin10100100000011111…
…10111001101100001
31001102022021120010021
422100033313031201
5140022030341001
65020302433441
7536560362232
oct122017671541
931368246107
1011010012001
11473a956a7a
122173292881
131066021801
14766359089
154468baba1
hex2903f7361

11010012001 has 4 divisors (see below), whose sum is σ = 11142662832. Its totient is φ = 10877361172.

The previous prime is 11010011959. The next prime is 11010012011. The reversal of 11010012001 is 10021001011.

11010012001 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11010012001 - 29 = 11010011489 is a prime.

It is a Duffinian number.

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

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

Almost surely, 211010012001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 132650830.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 11010012001 its reverse (10021001011), we get a palindrome (21031013012).

The spelling of 11010012001 in words is "eleven billion, ten million, twelve thousand, one".

Divisors: 1 83 132650747 11010012001