Base | Representation |
---|---|
bin | 110101011110101101110010… |
… | …1011000011111001010011101 |
3 | 2021200121011212220012120112201 |
4 | 1222331123211120133022131 |
5 | 443124232231213311021 |
6 | 4344253224142131501 |
7 | 201041215160254513 |
oct | 15275334530371235 |
9 | 2250534786176481 |
10 | 470414436463261 |
11 | 126985707782694 |
12 | 44915576b80b91 |
13 | 17263b7773c034 |
14 | 84242746c24b3 |
15 | 395b85bb18591 |
hex | 1abd6e561f29d |
470414436463261 has 2 divisors, whose sum is σ = 470414436463262. Its totient is φ = 470414436463260.
The previous prime is 470414436463217. The next prime is 470414436463291. The reversal of 470414436463261 is 162364634414074.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 452807970111225 + 17606466352036 = 21279285^2 + 4196006^2 .
It is a cyclic number.
It is not a de Polignac number, because 470414436463261 - 217 = 470414436332189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (470414436463291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 235207218231630 + 235207218231631.
It is an arithmetic number, because the mean of its divisors is an integer number (235207218231631).
Almost surely, 2470414436463261 is an apocalyptic number.
It is an amenable number.
470414436463261 is a deficient number, since it is larger than the sum of its proper divisors (1).
470414436463261 is an equidigital number, since it uses as much as digits as its factorization.
470414436463261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27869184, while the sum is 55.
The spelling of 470414436463261 in words is "four hundred seventy trillion, four hundred fourteen billion, four hundred thirty-six million, four hundred sixty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •