Base | Representation |
---|---|
bin | 10011000111101000… |
… | …01000101101101101 |
3 | 222111100112222020012 |
4 | 21203310020231231 |
5 | 132010210434112 |
6 | 4414312503005 |
7 | 512236126355 |
oct | 114364105555 |
9 | 28440488205 |
10 | 10264546157 |
11 | 43980834a8 |
12 | 1ba56aaa65 |
13 | c77753a68 |
14 | 6d5347b65 |
15 | 401217022 |
hex | 263d08b6d |
10264546157 has 2 divisors, whose sum is σ = 10264546158. Its totient is φ = 10264546156.
The previous prime is 10264546141. The next prime is 10264546163. The reversal of 10264546157 is 75164546201.
10264546157 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., 7866093481 + 2398452676 = 88691^2 + 48974^2 .
It is a cyclic number.
It is not a de Polignac number, because 10264546157 - 24 = 10264546141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10264548157) 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, 5132273078 + 5132273079.
It is an arithmetic number, because the mean of its divisors is an integer number (5132273079).
Almost surely, 210264546157 is an apocalyptic number.
It is an amenable number.
10264546157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10264546157 is an equidigital number, since it uses as much as digits as its factorization.
10264546157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 10264546157 in words is "ten billion, two hundred sixty-four million, five hundred forty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •