Base | Representation |
---|---|
bin | 100001001011011… |
… | …1111110111010001 |
3 | 2212120220202210121 |
4 | 1002112333313101 |
5 | 4240002400014 |
6 | 302250230241 |
7 | 36406051336 |
oct | 10226776721 |
9 | 2776822717 |
10 | 1113325009 |
11 | 521496615 |
12 | 270a25381 |
13 | 149867ac4 |
14 | a7c0a98d |
15 | 67b19124 |
hex | 425bfdd1 |
1113325009 has 4 divisors (see below), whose sum is σ = 1113393204. Its totient is φ = 1113256816.
The previous prime is 1113325001. The next prime is 1113325021. The reversal of 1113325009 is 9005233111.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 9005233111 = 7 ⋅1286461873.
It can be written as a sum of positive squares in 2 ways, for example, as 854275984 + 259049025 = 29228^2 + 16095^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113325009 - 23 = 1113325001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113325001) 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, 6519 + ... + 47635.
It is an arithmetic number, because the mean of its divisors is an integer number (278348301).
Almost surely, 21113325009 is an apocalyptic number.
It is an amenable number.
1113325009 is a deficient number, since it is larger than the sum of its proper divisors (68195).
1113325009 is an equidigital number, since it uses as much as digits as its factorization.
1113325009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68194.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 1113325009 is about 33366.5252760907. The cubic root of 1113325009 is about 1036.4316218164.
The spelling of 1113325009 in words is "one billion, one hundred thirteen million, three hundred twenty-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •