Base | Representation |
---|---|
bin | 100000110010000… |
… | …1011101111011001 |
3 | 2211122212000020111 |
4 | 1001210023233121 |
5 | 4223100114223 |
6 | 301052524321 |
7 | 36154611442 |
oct | 10144135731 |
9 | 2748760214 |
10 | 1100004313 |
11 | 514a18581 |
12 | 2684806a1 |
13 | 146b82935 |
14 | a61402c9 |
15 | 6688730d |
hex | 4190bbd9 |
1100004313 has 4 divisors (see below), whose sum is σ = 1100207268. Its totient is φ = 1099801360.
The previous prime is 1100004299. The next prime is 1100004317. The reversal of 1100004313 is 3134000011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 428779849 + 671224464 = 20707^2 + 25908^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100004313 - 25 = 1100004281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100004293 and 1100004302.
It is not an unprimeable number, because it can be changed into a prime (1100004317) 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, 93118 + ... + 104263.
It is an arithmetic number, because the mean of its divisors is an integer number (275051817).
Almost surely, 21100004313 is an apocalyptic number.
It is an amenable number.
1100004313 is a deficient number, since it is larger than the sum of its proper divisors (202955).
1100004313 is an equidigital number, since it uses as much as digits as its factorization.
1100004313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202954.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1100004313 is about 33166.3129244117. The cubic root of 1100004313 is about 1032.2814646134.
Adding to 1100004313 its reverse (3134000011), we get a palindrome (4234004324).
The spelling of 1100004313 in words is "one billion, one hundred million, four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •