Base | Representation |
---|---|
bin | 100000111010001… |
… | …1000101001011101 |
3 | 2211221211210021011 |
4 | 1001310120221131 |
5 | 4230142021420 |
6 | 301323535221 |
7 | 36235661041 |
oct | 10164305135 |
9 | 2757753234 |
10 | 1104251485 |
11 | 517359537 |
12 | 26998a511 |
13 | 147a0bb5c |
14 | a6928021 |
15 | 66e2595a |
hex | 41d18a5d |
1104251485 has 4 divisors (see below), whose sum is σ = 1325101788. Its totient is φ = 883401184.
The previous prime is 1104251479. The next prime is 1104251503. The reversal of 1104251485 is 5841524011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5841524011 = 2903 ⋅2012237.
It can be written as a sum of positive squares in 2 ways, for example, as 250968964 + 853282521 = 15842^2 + 29211^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104251485 - 25 = 1104251453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110425144 + ... + 110425153.
It is an arithmetic number, because the mean of its divisors is an integer number (331275447).
Almost surely, 21104251485 is an apocalyptic number.
It is an amenable number.
1104251485 is a deficient number, since it is larger than the sum of its proper divisors (220850303).
1104251485 is an equidigital number, since it uses as much as digits as its factorization.
1104251485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220850302.
The product of its (nonzero) digits is 6400, while the sum is 31.
The square root of 1104251485 is about 33230.2796407132. The cubic root of 1104251485 is about 1033.6083219465.
Adding to 1104251485 its reverse (5841524011), we get a palindrome (6945775496).
The spelling of 1104251485 in words is "one billion, one hundred four million, two hundred fifty-one thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •