Base | Representation |
---|---|
bin | 10101011001001101… |
… | …10000011010111111 |
3 | 1002122110111212000111 |
4 | 22230212300122333 |
5 | 142010324304201 |
6 | 5135420010451 |
7 | 554425324045 |
oct | 125446603277 |
9 | 32573455014 |
10 | 11485775551 |
11 | 496446a198 |
12 | 2286690a27 |
13 | 111076c0c3 |
14 | 7ad602395 |
15 | 473547b51 |
hex | 2ac9b06bf |
11485775551 has 2 divisors, whose sum is σ = 11485775552. Its totient is φ = 11485775550.
The previous prime is 11485775549. The next prime is 11485775593. The reversal of 11485775551 is 15557758411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11485775551 - 21 = 11485775549 is a prime.
Together with 11485775549, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11485775495 and 11485775504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11485775531) 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 as a sum of consecutive naturals, namely, 5742887775 + 5742887776.
It is an arithmetic number, because the mean of its divisors is an integer number (5742887776).
Almost surely, 211485775551 is an apocalyptic number.
11485775551 is a deficient number, since it is larger than the sum of its proper divisors (1).
11485775551 is an equidigital number, since it uses as much as digits as its factorization.
11485775551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 980000, while the sum is 49.
The spelling of 11485775551 in words is "eleven billion, four hundred eighty-five million, seven hundred seventy-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •