Search a number
-
+
11001051051 = 37151648127
BaseRepresentation
bin10100011111011011…
…01011011110101011
31001101200102022000020
422033231223132223
5140012232113201
65015342411523
7536421251064
oct121755533653
931350368006
1011001051051
114735896531
122170290ba3
131064204b83
147650a556b
15445beaa36
hex28fb6b7ab

11001051051 has 8 divisors (see below), whose sum is σ = 14874660864. Its totient is φ = 7230737640.

The previous prime is 11001051049. The next prime is 11001051077. The reversal of 11001051051 is 15015010011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11001051051 - 21 = 11001051049 is a prime.

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

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

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

Almost surely, 211001051051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51648201.

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 11001051051 its reverse (15015010011), we get a palindrome (26016061062).

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

Divisors: 1 3 71 213 51648127 154944381 3667017017 11001051051