Base | Representation |
---|---|
bin | 11000101010001… |
… | …010001111001001 |
3 | 1001211110101210101 |
4 | 120222022033021 |
5 | 1321402031121 |
6 | 105015045401 |
7 | 13152302332 |
oct | 3052121711 |
9 | 1054411711 |
10 | 413705161 |
11 | 1a25868a1 |
12 | b6670861 |
13 | 6792c76c |
14 | 3cd31289 |
15 | 264be491 |
hex | 18a8a3c9 |
413705161 has 2 divisors, whose sum is σ = 413705162. Its totient is φ = 413705160.
The previous prime is 413705063. The next prime is 413705189. The reversal of 413705161 is 161507314.
It is an a-pointer prime, because the next prime (413705189) can be obtained adding 413705161 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219632400 + 194072761 = 14820^2 + 13931^2 .
It is a cyclic number.
It is not a de Polignac number, because 413705161 - 29 = 413704649 is a prime.
It is not a weakly prime, because it can be changed into another prime (410705161) 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, 206852580 + 206852581.
It is an arithmetic number, because the mean of its divisors is an integer number (206852581).
Almost surely, 2413705161 is an apocalyptic number.
It is an amenable number.
413705161 is a deficient number, since it is larger than the sum of its proper divisors (1).
413705161 is an equidigital number, since it uses as much as digits as its factorization.
413705161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 413705161 is about 20339.7433857952. The cubic root of 413705161 is about 745.1270212678.
The spelling of 413705161 in words is "four hundred thirteen million, seven hundred five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •