Base | Representation |
---|---|
bin | 10010110100000001… |
… | …01000110001110001 |
3 | 222001220000202101002 |
4 | 21122000220301301 |
5 | 131141103113212 |
6 | 4350115051345 |
7 | 505201005665 |
oct | 113200506161 |
9 | 28056022332 |
10 | 10100051057 |
11 | 4313240938 |
12 | 1b5a5a0b55 |
13 | c4c64b295 |
14 | 6bb5688a5 |
15 | 3e1a72ac2 |
hex | 25a028c71 |
10100051057 has 2 divisors, whose sum is σ = 10100051058. Its totient is φ = 10100051056.
The previous prime is 10100051029. The next prime is 10100051063. The reversal of 10100051057 is 75015000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5807049616 + 4293001441 = 76204^2 + 65521^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100051057 - 26 = 10100050993 is a prime.
It is a super-2 number, since 2×101000510572 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10100051257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050025528 + 5050025529.
It is an arithmetic number, because the mean of its divisors is an integer number (5050025529).
Almost surely, 210100051057 is an apocalyptic number.
It is an amenable number.
10100051057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100051057 is an equidigital number, since it uses as much as digits as its factorization.
10100051057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 175, while the sum is 20.
Adding to 10100051057 its reverse (75015000101), we get a palindrome (85115051158).
The spelling of 10100051057 in words is "ten billion, one hundred million, fifty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •