Base | Representation |
---|---|
bin | 10011000010010100… |
… | …00011110011111101 |
3 | 222101020122211201012 |
4 | 21201022003303331 |
5 | 131412302232342 |
6 | 4410041125005 |
7 | 511155145256 |
oct | 114112036375 |
9 | 28336584635 |
10 | 10219961597 |
11 | 43749a145a |
12 | 1b92789765 |
13 | c6b443571 |
14 | 6cd45db2d |
15 | 3ec35bb82 |
hex | 261283cfd |
10219961597 has 2 divisors, whose sum is σ = 10219961598. Its totient is φ = 10219961596.
The previous prime is 10219961567. The next prime is 10219961599. The reversal of 10219961597 is 79516991201.
10219961597 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., 9112802521 + 1107159076 = 95461^2 + 33274^2 .
It is a cyclic number.
It is not a de Polignac number, because 10219961597 - 232 = 5924994301 is a prime.
Together with 10219961599, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10219961599) 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, 5109980798 + 5109980799.
It is an arithmetic number, because the mean of its divisors is an integer number (5109980799).
Almost surely, 210219961597 is an apocalyptic number.
It is an amenable number.
10219961597 is a deficient number, since it is larger than the sum of its proper divisors (1).
10219961597 is an equidigital number, since it uses as much as digits as its factorization.
10219961597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 306180, while the sum is 50.
The spelling of 10219961597 in words is "ten billion, two hundred nineteen million, nine hundred sixty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •