Search a number
-
+
11012111001 = 33407855963
BaseRepresentation
bin10100100000101111…
…10111101010011001
31001102110020012102000
422100113313222121
5140023100023001
65020415431213
7536614253613
oct122027675231
931373205360
1011012111001
11474105aa91
122173b25509
1310665a8018
14766743db3
15446b82a86
hex2905f7a99

11012111001 has 8 divisors (see below), whose sum is σ = 16314238560. Its totient is φ = 7341407316.

The previous prime is 11012110979. The next prime is 11012111003. The reversal of 11012111001 is 10011121011.

It is not a de Polignac number, because 11012111001 - 213 = 11012102809 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203927955 + ... + 203928008.

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

Almost surely, 211012111001 is an apocalyptic number.

It is an amenable number.

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

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

11012111001 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11012111001 its reverse (10011121011), we get a palindrome (21023232012).

It can be divided in two parts, 110121 and 11001, that multiplied together give a palindrome (1211441121).

The spelling of 11012111001 in words is "eleven billion, twelve million, one hundred eleven thousand, one".

Divisors: 1 3 9 27 407855963 1223567889 3670703667 11012111001