Base | Representation |
---|---|
bin | 100000111010001… |
… | …0010000000111001 |
3 | 2211221210101222210 |
4 | 1001310102000321 |
5 | 4230140134223 |
6 | 301323205333 |
7 | 36235515603 |
oct | 10164220071 |
9 | 2757711883 |
10 | 1104224313 |
11 | 517340085 |
12 | 269976849 |
13 | 1479cc68a |
14 | a691c173 |
15 | 66e1c893 |
hex | 41d12039 |
1104224313 has 16 divisors (see below), whose sum is σ = 1502369856. Its totient is φ = 721156800.
The previous prime is 1104224299. The next prime is 1104224323. The reversal of 1104224313 is 3134224011.
It is not a de Polignac number, because 1104224313 - 216 = 1104158777 is a prime.
It is a super-2 number, since 2×11042243132 = 2438622666840643938, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1104224313.
It is not an unprimeable number, because it can be changed into a prime (1104224323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106506 + ... + 116412.
It is an arithmetic number, because the mean of its divisors is an integer number (93898116).
Almost surely, 21104224313 is an apocalyptic number.
It is an amenable number.
1104224313 is a deficient number, since it is larger than the sum of its proper divisors (398145543).
1104224313 is an equidigital number, since it uses as much as digits as its factorization.
1104224313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10664.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1104224313 is about 33229.8707942116. The cubic root of 1104224313 is about 1033.5998439756.
Adding to 1104224313 its reverse (3134224011), we get a palindrome (4238448324).
The spelling of 1104224313 in words is "one billion, one hundred four million, two hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •