Base | Representation |
---|---|
bin | 100001001011011… |
… | …1010111111011101 |
3 | 2212120212202102111 |
4 | 1002112322333131 |
5 | 4240001230203 |
6 | 302245554021 |
7 | 36405636220 |
oct | 10226727735 |
9 | 2776782374 |
10 | 1113305053 |
11 | 521482623 |
12 | 270a15911 |
13 | 14985b9b3 |
14 | a7c035b7 |
15 | 67b1326d |
hex | 425bafdd |
1113305053 has 4 divisors (see below), whose sum is σ = 1272348640. Its totient is φ = 954261468.
The previous prime is 1113305047. The next prime is 1113305093. The reversal of 1113305053 is 3505033111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1113305053 - 213 = 1113296861 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 (1113305003) 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 in 3 ways as a sum of consecutive naturals, for example, 79521783 + ... + 79521796.
It is an arithmetic number, because the mean of its divisors is an integer number (318087160).
Almost surely, 21113305053 is an apocalyptic number.
It is an amenable number.
1113305053 is a deficient number, since it is larger than the sum of its proper divisors (159043587).
1113305053 is an equidigital number, since it uses as much as digits as its factorization.
1113305053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159043586.
The product of its (nonzero) digits is 675, while the sum is 22.
The square root of 1113305053 is about 33366.2262325244. The cubic root of 1113305053 is about 1036.4254292094.
Adding to 1113305053 its reverse (3505033111), we get a palindrome (4618338164).
The spelling of 1113305053 in words is "one billion, one hundred thirteen million, three hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •