Base | Representation |
---|---|
bin | 10100101000010001… |
… | …11101101110101001 |
3 | 1001120212011011122020 |
4 | 22110020331232221 |
5 | 140140240000203 |
6 | 5030554215053 |
7 | 541312413654 |
oct | 122410755651 |
9 | 31525134566 |
10 | 11075312553 |
11 | 47737a8278 |
12 | 2191124489 |
13 | 10767062a6 |
14 | 770cb689b |
15 | 44c4b9153 |
hex | 29423dba9 |
11075312553 has 8 divisors (see below), whose sum is σ = 15544298400. Its totient is φ = 6994934208.
The previous prime is 11075312531. The next prime is 11075312597. The reversal of 11075312553 is 35521357011.
11075312553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11075312553 - 29 = 11075312041 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11075312503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97151808 + ... + 97151921.
It is an arithmetic number, because the mean of its divisors is an integer number (1943037300).
Almost surely, 211075312553 is an apocalyptic number.
It is an amenable number.
11075312553 is a deficient number, since it is larger than the sum of its proper divisors (4468985847).
11075312553 is a wasteful number, since it uses less digits than its factorization.
11075312553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194303751.
The product of its (nonzero) digits is 15750, while the sum is 33.
Adding to 11075312553 its reverse (35521357011), we get a palindrome (46596669564).
The spelling of 11075312553 in words is "eleven billion, seventy-five million, three hundred twelve thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •