Base | Representation |
---|---|
bin | 100001101111001… |
… | …0000010001000001 |
3 | 2220220001210010112 |
4 | 1003132100101001 |
5 | 4304243120132 |
6 | 304154441105 |
7 | 40023610265 |
oct | 10336202101 |
9 | 2826053115 |
10 | 1132004417 |
11 | 530a94745 |
12 | 277133195 |
13 | 1506a80cb |
14 | aa4b00a5 |
15 | 695a8ab2 |
hex | 43790441 |
1132004417 has 2 divisors, whose sum is σ = 1132004418. Its totient is φ = 1132004416.
The previous prime is 1132004411. The next prime is 1132004431. The reversal of 1132004417 is 7144002311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 829209616 + 302794801 = 28796^2 + 17401^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132004417 - 28 = 1132004161 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1132004392 and 1132004401.
It is not a weakly prime, because it can be changed into another prime (1132004411) 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 as a sum of consecutive naturals, namely, 566002208 + 566002209.
It is an arithmetic number, because the mean of its divisors is an integer number (566002209).
Almost surely, 21132004417 is an apocalyptic number.
It is an amenable number.
1132004417 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132004417 is an equidigital number, since it uses as much as digits as its factorization.
1132004417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 1132004417 is about 33645.2733233065. The cubic root of 1132004417 is about 1042.1959323840.
Adding to 1132004417 its reverse (7144002311), we get a palindrome (8276006728).
The spelling of 1132004417 in words is "one billion, one hundred thirty-two million, four thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •