Base | Representation |
---|---|
bin | 100000101100000… |
… | …0001100110011001 |
3 | 2211102212002010200 |
4 | 1001120001212121 |
5 | 4221241121144 |
6 | 300500332413 |
7 | 36115535226 |
oct | 10130014631 |
9 | 2742762120 |
10 | 1096817049 |
11 | 513140979 |
12 | 2673a4109 |
13 | 146307c93 |
14 | a595094d |
15 | 66457c69 |
hex | 41601999 |
1096817049 has 6 divisors (see below), whose sum is σ = 1584291306. Its totient is φ = 731211360.
The previous prime is 1096816997. The next prime is 1096817063. The reversal of 1096817049 is 9407186901.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 593263449 + 503553600 = 24357^2 + 22440^2 .
It is not a de Polignac number, because 1096817049 - 28 = 1096816793 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1096816995 and 1096817013.
It is not an unprimeable number, because it can be changed into a prime (1096817069) 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 5 ways as a sum of consecutive naturals, for example, 60934272 + ... + 60934289.
It is an arithmetic number, because the mean of its divisors is an integer number (264048551).
Almost surely, 21096817049 is an apocalyptic number.
It is an amenable number.
1096817049 is a deficient number, since it is larger than the sum of its proper divisors (487474257).
1096817049 is a wasteful number, since it uses less digits than its factorization.
1096817049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121868567 (or 121868564 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 45.
The square root of 1096817049 is about 33118.2283493547. The cubic root of 1096817049 is about 1031.2834877941.
The spelling of 1096817049 in words is "one billion, ninety-six million, eight hundred seventeen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •