Base | Representation |
---|---|
bin | 111111011011001… |
… | …110000100111101 |
3 | 2202011021212222221 |
4 | 333123032010331 |
5 | 4134402201112 |
6 | 253331205341 |
7 | 35240462551 |
oct | 7733160475 |
9 | 2664255887 |
10 | 1064100157 |
11 | 4a672521a |
12 | 258446851 |
13 | 13c5c1483 |
14 | a1475861 |
15 | 63643e07 |
hex | 3f6ce13d |
1064100157 has 2 divisors, whose sum is σ = 1064100158. Its totient is φ = 1064100156.
The previous prime is 1064100151. The next prime is 1064100173. The reversal of 1064100157 is 7510014601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 664659961 + 399440196 = 25781^2 + 19986^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064100157 - 223 = 1055711549 is a prime.
It is a super-2 number, since 2×10641001572 = 2264618288254849298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1064100151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532050078 + 532050079.
It is an arithmetic number, because the mean of its divisors is an integer number (532050079).
Almost surely, 21064100157 is an apocalyptic number.
It is an amenable number.
1064100157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064100157 is an equidigital number, since it uses as much as digits as its factorization.
1064100157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 1064100157 is about 32620.5480793931. The cubic root of 1064100157 is about 1020.9257764951.
Adding to 1064100157 its reverse (7510014601), we get a palindrome (8574114758).
The spelling of 1064100157 in words is "one billion, sixty-four million, one hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •