Base | Representation |
---|---|
bin | 10010110111111101… |
… | …10000000111011001 |
3 | 222011012020101102221 |
4 | 21123332300013121 |
5 | 131223034030012 |
6 | 4353255424041 |
7 | 506052011263 |
oct | 113376600731 |
9 | 28135211387 |
10 | 10133111257 |
11 | 432a971515 |
12 | 1b69685021 |
13 | c56455129 |
14 | 6c1ad2b33 |
15 | 3e4903507 |
hex | 25bfb01d9 |
10133111257 has 2 divisors, whose sum is σ = 10133111258. Its totient is φ = 10133111256.
The previous prime is 10133111213. The next prime is 10133111279. The reversal of 10133111257 is 75211133101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9474880921 + 658230336 = 97339^2 + 25656^2 .
It is a cyclic number.
It is not a de Polignac number, because 10133111257 - 211 = 10133109209 is a prime.
It is not a weakly prime, because it can be changed into another prime (10133111957) 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, 5066555628 + 5066555629.
It is an arithmetic number, because the mean of its divisors is an integer number (5066555629).
Almost surely, 210133111257 is an apocalyptic number.
It is an amenable number.
10133111257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133111257 is an equidigital number, since it uses as much as digits as its factorization.
10133111257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 25.
Adding to 10133111257 its reverse (75211133101), we get a palindrome (85344244358).
The spelling of 10133111257 in words is "ten billion, one hundred thirty-three million, one hundred eleven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •