Search a number
-
+
11001010010 = 252773939659
BaseRepresentation
bin10100011111011011…
…00001011101011010
31001101200100012201012
422033231201131122
5140012224310020
65015341453522
7536421020324
oct121755413532
931350305635
1011001010010
114735868711
1221702712a2
1310641bc2a3
14765094614
15445bdd7c5
hex28fb6175a

11001010010 has 16 divisors (see below), whose sum is σ = 19803031200. Its totient is φ = 4400134416.

The previous prime is 11001010003. The next prime is 11001010037. The reversal of 11001010010 is 1001010011.

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

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 11001009976 and 11001010003.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 257561 + ... + 297219.

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

Almost surely, 211001010010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 67405.

The product of its (nonzero) digits is 1, while the sum is 5.

Adding to 11001010010 its reverse (1001010011), we get a palindrome (12002020021).

Subtracting from 11001010010 its reverse (1001010011), we obtain a palindrome (9999999999).

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

Divisors: 1 2 5 10 27739 39659 55478 79318 138695 198295 277390 396590 1100101001 2200202002 5500505005 11001010010