Base | Representation |
---|---|
bin | 10100100100001110… |
… | …00010000011011111 |
3 | 1001111111001200201122 |
4 | 22102013002003133 |
5 | 140103030022201 |
6 | 5023340201155 |
7 | 540420042521 |
oct | 122207020337 |
9 | 31444050648 |
10 | 11041251551 |
11 | 4756553790 |
12 | 21818391bb |
13 | 106c63ba55 |
14 | 76a56ba11 |
15 | 4494dbe1b |
hex | 2921c20df |
11041251551 has 16 divisors (see below), whose sum is σ = 12239605248. Its totient is φ = 9876578400.
The previous prime is 11041251523. The next prime is 11041251581. The reversal of 11041251551 is 15515214011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11041251551 - 214 = 11041235167 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 11041251551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11041251581) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 146846 + ... + 208916.
It is an arithmetic number, because the mean of its divisors is an integer number (764975328).
Almost surely, 211041251551 is an apocalyptic number.
11041251551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11041251551 is a deficient number, since it is larger than the sum of its proper divisors (1198353697).
11041251551 is a wasteful number, since it uses less digits than its factorization.
11041251551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62342.
The product of its (nonzero) digits is 1000, while the sum is 26.
Adding to 11041251551 its reverse (15515214011), we get a palindrome (26556465562).
The spelling of 11041251551 in words is "eleven billion, forty-one million, two hundred fifty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •