Base | Representation |
---|---|
bin | 100001001011010… |
… | …0001110111000001 |
3 | 2212120200112012220 |
4 | 1002112201313001 |
5 | 4234434431423 |
6 | 302243441253 |
7 | 36405030132 |
oct | 10226416701 |
9 | 2776615186 |
10 | 1113202113 |
11 | 521412251 |
12 | 270986229 |
13 | 149823b9a |
14 | a7bb7c89 |
15 | 67ae29e3 |
hex | 425a1dc1 |
1113202113 has 8 divisors (see below), whose sum is σ = 1505174976. Its totient is φ = 731682000.
The previous prime is 1113202073. The next prime is 1113202141. The reversal of 1113202113 is 3112023111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1113202113 - 229 = 576331201 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1113202092 and 1113202101.
It is not an unprimeable number, because it can be changed into a prime (1113202163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2612938 + ... + 2613363.
It is an arithmetic number, because the mean of its divisors is an integer number (188146872).
Almost surely, 21113202113 is an apocalyptic number.
It is an amenable number.
1113202113 is a deficient number, since it is larger than the sum of its proper divisors (391972863).
1113202113 is an equidigital number, since it uses as much as digits as its factorization.
1113202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5226375.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1113202113 is about 33364.6836190604. The cubic root of 1113202113 is about 1036.3934844092.
Adding to 1113202113 its reverse (3112023111), we get a palindrome (4225225224).
The spelling of 1113202113 in words is "one billion, one hundred thirteen million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •