Base | Representation |
---|---|
bin | 100001001011100… |
… | …0010010011011001 |
3 | 2212120221021111200 |
4 | 1002113002103121 |
5 | 4240003210001 |
6 | 302250344413 |
7 | 36406122432 |
oct | 10227022331 |
9 | 2776837450 |
10 | 1113335001 |
11 | 5214a3079 |
12 | 270a2b109 |
13 | 14986c50c |
14 | a7c10489 |
15 | 67b1c086 |
hex | 425c24d9 |
1113335001 has 12 divisors (see below), whose sum is σ = 1692790320. Its totient is φ = 703158840.
The previous prime is 1113334993. The next prime is 1113335009. The reversal of 1113335001 is 1005333111.
It is an interprime number because it is at equal distance from previous prime (1113334993) and next prime (1113335009).
It is not a de Polignac number, because 1113335001 - 23 = 1113334993 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1113335009) 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 11 ways as a sum of consecutive naturals, for example, 3255195 + ... + 3255536.
It is an arithmetic number, because the mean of its divisors is an integer number (141065860).
Almost surely, 21113335001 is an apocalyptic number.
It is an amenable number.
1113335001 is a deficient number, since it is larger than the sum of its proper divisors (579455319).
1113335001 is a wasteful number, since it uses less digits than its factorization.
1113335001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6510756 (or 6510753 counting only the distinct ones).
The product of its (nonzero) digits is 135, while the sum is 18.
The square root of 1113335001 is about 33366.6750066590. The cubic root of 1113335001 is about 1036.4347224366.
Adding to 1113335001 its reverse (1005333111), we get a palindrome (2118668112).
The spelling of 1113335001 in words is "one billion, one hundred thirteen million, three hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •