Search a number
-
+
11002700001 = 367163499673
BaseRepresentation
bin10100011111100111…
…11110000011100001
31001101210112001221110
422033303332003201
5140013142400001
65015442013533
7536441256366
oct121763760341
931353461843
1011002700001
1147368123a7
1221709472a9
131064661597
147653b446d
15445e243d6
hex28fcfe0e1

11002700001 has 32 divisors (see below), whose sum is σ = 15032896000. Its totient is φ = 7156283904.

The previous prime is 11002699979. The next prime is 11002700011. The reversal of 11002700001 is 10000720011.

It is not a de Polignac number, because 11002700001 - 26 = 11002699937 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 11002700001.

It is not an unprimeable number, because it can be changed into a prime (11002700011) 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 31 ways as a sum of consecutive naturals, for example, 16348401 + ... + 16349073.

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

Almost surely, 211002700001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1405.

The product of its (nonzero) digits is 14, while the sum is 12.

The spelling of 11002700001 in words is "eleven billion, two million, seven hundred thousand, one".

Divisors: 1 3 67 163 201 489 499 673 1497 2019 10921 32763 33433 45091 81337 100299 109699 135273 244011 329097 335827 1007481 5449579 7349833 16348737 22049499 22500409 54739801 67501227 164219403 3667566667 11002700001