Base | Representation |
---|---|
bin | 100001001011011… |
… | …1101100010101101 |
3 | 2212120220021202110 |
4 | 1002112331202231 |
5 | 4240002044001 |
6 | 302250114233 |
7 | 36406011534 |
oct | 10226754255 |
9 | 2776807673 |
10 | 1113315501 |
11 | 52148a461 |
12 | 270a1b979 |
13 | 14986368c |
14 | a7c0731b |
15 | 67b163d6 |
hex | 425bd8ad |
1113315501 has 4 divisors (see below), whose sum is σ = 1484420672. Its totient is φ = 742210332.
The previous prime is 1113315473. The next prime is 1113315503. The reversal of 1113315501 is 1055133111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1055133111 = 3 ⋅351711037.
It is not a de Polignac number, because 1113315501 - 27 = 1113315373 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 (1113315503) 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, 185552581 + ... + 185552586.
It is an arithmetic number, because the mean of its divisors is an integer number (371105168).
Almost surely, 21113315501 is an apocalyptic number.
It is an amenable number.
1113315501 is a deficient number, since it is larger than the sum of its proper divisors (371105171).
1113315501 is an equidigital number, since it uses as much as digits as its factorization.
1113315501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 371105170.
The product of its (nonzero) digits is 225, while the sum is 21.
The square root of 1113315501 is about 33366.3827976603. The cubic root of 1113315501 is about 1036.4286713693.
Adding to 1113315501 its reverse (1055133111), we get a palindrome (2168448612).
The spelling of 1113315501 in words is "one billion, one hundred thirteen million, three hundred fifteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •