Base | Representation |
---|---|
bin | 10010110100101011… |
… | …10011101000011001 |
3 | 222002021110200211101 |
4 | 21122111303220121 |
5 | 131144013204122 |
6 | 4350434031401 |
7 | 505266121144 |
oct | 113225635031 |
9 | 28067420741 |
10 | 10105600537 |
11 | 431639128a |
12 | 1b60418561 |
13 | c508421b6 |
14 | 6bc1b105b |
15 | 3e22bc027 |
hex | 25a573a19 |
10105600537 has 2 divisors, whose sum is σ = 10105600538. Its totient is φ = 10105600536.
The previous prime is 10105600529. The next prime is 10105600573. The reversal of 10105600537 is 73500650101.
10105600537 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
Together with next prime (10105600573) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5472892441 + 4632708096 = 73979^2 + 68064^2 .
It is a cyclic number.
It is not a de Polignac number, because 10105600537 - 23 = 10105600529 is a prime.
It is not a weakly prime, because it can be changed into another prime (10105609537) 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, 5052800268 + 5052800269.
It is an arithmetic number, because the mean of its divisors is an integer number (5052800269).
Almost surely, 210105600537 is an apocalyptic number.
It is an amenable number.
10105600537 is a deficient number, since it is larger than the sum of its proper divisors (1).
10105600537 is an equidigital number, since it uses as much as digits as its factorization.
10105600537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
The spelling of 10105600537 in words is "ten billion, one hundred five million, six hundred thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •