Base | Representation |
---|---|
bin | 10100101101110110… |
… | …00100110101110001 |
3 | 1001201010000022022122 |
4 | 22112323010311301 |
5 | 140234213101223 |
6 | 5035343044025 |
7 | 542420316431 |
oct | 122673046561 |
9 | 31633008278 |
10 | 11122003313 |
11 | 4798098783 |
12 | 21a48a0615 |
13 | 10832a3365 |
14 | 77718c2c1 |
15 | 45163d5c8 |
hex | 296ec4d71 |
11122003313 has 8 divisors (see below), whose sum is σ = 11796658632. Its totient is φ = 10449616896.
The previous prime is 11122003297. The next prime is 11122003327. The reversal of 11122003313 is 31330022111.
It can be written as a sum of positive squares in 4 ways, for example, as 8579020129 + 2542983184 = 92623^2 + 50428^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11122003313 - 24 = 11122003297 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 11122003291 and 11122003300.
It is not an unprimeable number, because it can be changed into a prime (11122003213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 557120 + ... + 576737.
It is an arithmetic number, because the mean of its divisors is an integer number (1474582329).
Almost surely, 211122003313 is an apocalyptic number.
It is an amenable number.
11122003313 is a deficient number, since it is larger than the sum of its proper divisors (674655319).
11122003313 is a wasteful number, since it uses less digits than its factorization.
11122003313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1134451.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11122003313 its reverse (31330022111), we get a palindrome (42452025424).
The spelling of 11122003313 in words is "eleven billion, one hundred twenty-two million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •