Base | Representation |
---|---|
bin | 10010110111001001… |
… | …01001010011001101 |
3 | 222010201100200201001 |
4 | 21123210221103031 |
5 | 131214311030342 |
6 | 4352453020301 |
7 | 505636566025 |
oct | 113344512315 |
9 | 28121320631 |
10 | 10126267597 |
11 | 43270177a6 |
12 | 1b67324691 |
13 | c54bca124 |
14 | 6c0c30a85 |
15 | 3e40008b7 |
hex | 25b9294cd |
10126267597 has 2 divisors, whose sum is σ = 10126267598. Its totient is φ = 10126267596.
The previous prime is 10126267579. The next prime is 10126267601. The reversal of 10126267597 is 79576262101.
10126267597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (10126267579) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8423384841 + 1702882756 = 91779^2 + 41266^2 .
It is a cyclic number.
It is not a de Polignac number, because 10126267597 - 215 = 10126234829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10126267537) 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, 5063133798 + 5063133799.
It is an arithmetic number, because the mean of its divisors is an integer number (5063133799).
Almost surely, 210126267597 is an apocalyptic number.
It is an amenable number.
10126267597 is a deficient number, since it is larger than the sum of its proper divisors (1).
10126267597 is an equidigital number, since it uses as much as digits as its factorization.
10126267597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317520, while the sum is 46.
The spelling of 10126267597 in words is "ten billion, one hundred twenty-six million, two hundred sixty-seven thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •