Base | Representation |
---|---|
bin | 100000111010100… |
… | …0011000011110100 |
3 | 2211222011121120012 |
4 | 1001311003003310 |
5 | 4230213101304 |
6 | 301331355352 |
7 | 36240313361 |
oct | 10165030364 |
9 | 2758147505 |
10 | 1104425204 |
11 | 517468003 |
12 | 269a52b58 |
13 | 147a6cc4c |
14 | a6971468 |
15 | 66e5c16e |
hex | 41d430f4 |
1104425204 has 6 divisors (see below), whose sum is σ = 1932744114. Its totient is φ = 552212600.
The previous prime is 1104425177. The next prime is 1104425209. The reversal of 1104425204 is 4025244011.
It can be written as a sum of positive squares in only one way, i.e., 753612304 + 350812900 = 27452^2 + 18730^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1104425204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104425209) 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 as a sum of consecutive naturals, namely, 138053147 + ... + 138053154.
It is an arithmetic number, because the mean of its divisors is an integer number (322124019).
Almost surely, 21104425204 is an apocalyptic number.
It is an amenable number.
1104425204 is a deficient number, since it is larger than the sum of its proper divisors (828318910).
1104425204 is a wasteful number, since it uses less digits than its factorization.
1104425204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276106305 (or 276106303 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 23.
The square root of 1104425204 is about 33232.8934039755. The cubic root of 1104425204 is about 1033.6625209496.
Adding to 1104425204 its reverse (4025244011), we get a palindrome (5129669215).
The spelling of 1104425204 in words is "one billion, one hundred four million, four hundred twenty-five thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •