Base | Representation |
---|---|
bin | 10101001111011000… |
… | …01011011111001101 |
3 | 1002102201100012222211 |
4 | 22213230023133031 |
5 | 141323221423203 |
6 | 5123312310421 |
7 | 552404354551 |
oct | 124754133715 |
9 | 32381305884 |
10 | 11403311053 |
11 | 4921965412 |
12 | 2262b42411 |
13 | 10c9658044 |
14 | 7a2697861 |
15 | 46b1a8c6d |
hex | 2a7b0b7cd |
11403311053 has 4 divisors (see below), whose sum is σ = 11418868828. Its totient is φ = 11387753280.
The previous prime is 11403311027. The next prime is 11403311071. The reversal of 11403311053 is 35011330411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35011330411 = 23 ⋅1522231757.
It can be written as a sum of positive squares in 2 ways, for example, as 10808097444 + 595213609 = 103962^2 + 24397^2 .
It is a cyclic number.
It is not a de Polignac number, because 11403311053 - 213 = 11403302861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11403311753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7777788 + ... + 7779253.
It is an arithmetic number, because the mean of its divisors is an integer number (2854717207).
Almost surely, 211403311053 is an apocalyptic number.
It is an amenable number.
11403311053 is a deficient number, since it is larger than the sum of its proper divisors (15557775).
11403311053 is an equidigital number, since it uses as much as digits as its factorization.
11403311053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15557774.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 11403311053 its reverse (35011330411), we get a palindrome (46414641464).
The spelling of 11403311053 in words is "eleven billion, four hundred three million, three hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •