Base | Representation |
---|---|
bin | 100000101011111… |
… | …1110100111110101 |
3 | 2211102211110101222 |
4 | 1001113332213311 |
5 | 4221240223403 |
6 | 300500200125 |
7 | 36115454534 |
oct | 10127764765 |
9 | 2742743358 |
10 | 1096804853 |
11 | 5131327a1 |
12 | 267399045 |
13 | 146302571 |
14 | a594a31b |
15 | 66454338 |
hex | 415fe9f5 |
1096804853 has 8 divisors (see below), whose sum is σ = 1136679480. Its totient is φ = 1057067200.
The previous prime is 1096804783. The next prime is 1096804871. The reversal of 1096804853 is 3584086901.
It can be written as a sum of positive squares in 4 ways, for example, as 85692049 + 1011112804 = 9257^2 + 31798^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1096804853 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1096804153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17798 + ... + 50103.
It is an arithmetic number, because the mean of its divisors is an integer number (142084935).
Almost surely, 21096804853 is an apocalyptic number.
It is an amenable number.
1096804853 is a deficient number, since it is larger than the sum of its proper divisors (39874627).
1096804853 is an equidigital number, since it uses as much as digits as its factorization.
1096804853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68487.
The product of its (nonzero) digits is 207360, while the sum is 44.
The square root of 1096804853 is about 33118.0442206360. The cubic root of 1096804853 is about 1031.2796653456.
The spelling of 1096804853 in words is "one billion, ninety-six million, eight hundred four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •