Base | Representation |
---|---|
bin | 100000111010011… |
… | …1111010101101001 |
3 | 2211222010211122122 |
4 | 1001310333111221 |
5 | 4230212104321 |
6 | 301331201025 |
7 | 36240221054 |
oct | 10164772551 |
9 | 2758124578 |
10 | 1104409961 |
11 | 517457606 |
12 | 269a46175 |
13 | 147a66025 |
14 | a6969a9b |
15 | 66e578ab |
hex | 41d3f569 |
1104409961 has 2 divisors, whose sum is σ = 1104409962. Its totient is φ = 1104409960.
The previous prime is 1104409951. The next prime is 1104409993. The reversal of 1104409961 is 1699044011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1034587225 + 69822736 = 32165^2 + 8356^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104409961 - 230 = 30668137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1104409921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552204980 + 552204981.
It is an arithmetic number, because the mean of its divisors is an integer number (552204981).
Almost surely, 21104409961 is an apocalyptic number.
It is an amenable number.
1104409961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104409961 is an equidigital number, since it uses as much as digits as its factorization.
1104409961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 1104409961 is about 33232.6640671494. The cubic root of 1104409961 is about 1033.6577654773.
The spelling of 1104409961 in words is "one billion, one hundred four million, four hundred nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •