Base | Representation |
---|---|
bin | 101001110100001… |
… | …0000001110101001 |
3 | 10121210002220002012 |
4 | 1103220100032221 |
5 | 10333140424121 |
6 | 351120245305 |
7 | 46524552215 |
oct | 12350201651 |
9 | 3553086065 |
10 | 1403061161 |
11 | 65aa9a687 |
12 | 331a70835 |
13 | 1948b0c08 |
14 | d44ab945 |
15 | 8329bc5b |
hex | 53a103a9 |
1403061161 has 2 divisors, whose sum is σ = 1403061162. Its totient is φ = 1403061160.
The previous prime is 1403061113. The next prime is 1403061167. The reversal of 1403061161 is 1611603041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1126005136 + 277056025 = 33556^2 + 16645^2 .
It is a cyclic number.
It is not a de Polignac number, because 1403061161 - 26 = 1403061097 is a prime.
It is not a weakly prime, because it can be changed into another prime (1403061167) 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, 701530580 + 701530581.
It is an arithmetic number, because the mean of its divisors is an integer number (701530581).
Almost surely, 21403061161 is an apocalyptic number.
It is an amenable number.
1403061161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1403061161 is an equidigital number, since it uses as much as digits as its factorization.
1403061161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1403061161 is about 37457.4580157277. The cubic root of 1403061161 is about 1119.5037025714.
The spelling of 1403061161 in words is "one billion, four hundred three million, sixty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •