Base | Representation |
---|---|
bin | 10011011001101111… |
… | …00001111000000101 |
3 | 222212221100111111211 |
4 | 21230313201320011 |
5 | 132313101234342 |
6 | 4441340131421 |
7 | 516062125216 |
oct | 115467417005 |
9 | 28787314454 |
10 | 10416430597 |
11 | 4465892531 |
12 | 2028536b71 |
13 | ca0062601 |
14 | 70b5a340d |
15 | 40e719c17 |
hex | 26cde1e05 |
10416430597 has 2 divisors, whose sum is σ = 10416430598. Its totient is φ = 10416430596.
The previous prime is 10416430501. The next prime is 10416430679. The reversal of 10416430597 is 79503461401.
10416430597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10122170881 + 294259716 = 100609^2 + 17154^2 .
It is a cyclic number.
It is not a de Polignac number, because 10416430597 - 27 = 10416430469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10416430397) 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, 5208215298 + 5208215299.
It is an arithmetic number, because the mean of its divisors is an integer number (5208215299).
Almost surely, 210416430597 is an apocalyptic number.
It is an amenable number.
10416430597 is a deficient number, since it is larger than the sum of its proper divisors (1).
10416430597 is an equidigital number, since it uses as much as digits as its factorization.
10416430597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 40.
Adding to 10416430597 its reverse (79503461401), we get a palindrome (89919891998).
The spelling of 10416430597 in words is "ten billion, four hundred sixteen million, four hundred thirty thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •