Search a number
-
+
11000051001 = 322353140343
BaseRepresentation
bin10100011111010011…
…10111010100111001
31001101121112111012100
422033221313110321
5140012003113001
65015305134013
7536406614352
oct121751672471
931347474170
1011000051001
114735273145
12216ba8a309
131063c44924
14764cc4d29
15445a9e586
hex28fa77539

11000051001 has 12 divisors (see below), whose sum is σ = 16579787328. Its totient is φ = 7014525144.

The previous prime is 11000050981. The next prime is 11000051003. The reversal of 11000051001 is 10015000011.

It is not a de Polignac number, because 11000051001 - 26 = 11000050937 is a prime.

It is a super-2 number, since 2×110000510012 (a number of 21 digits) contains 22 as substring.

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 (11000051003) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26569965 + ... + 26570378.

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

Almost surely, 211000051001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11000051001 its reverse (10015000011), we get a palindrome (21015051012).

The spelling of 11000051001 in words is "eleven billion, fifty-one thousand, one".

Divisors: 1 3 9 23 69 207 53140343 159421029 478263087 1222227889 3666683667 11000051001