Base | Representation |
---|---|
bin | 101111101011110100… |
… | …101100100110101111 |
3 | 11220011021220101100201 |
4 | 233223310230212233 |
5 | 1314324440201312 |
6 | 35304345134331 |
7 | 3461545112425 |
oct | 575364544657 |
9 | 156137811321 |
10 | 51201100207 |
11 | 1a794760454 |
12 | 9b0b18a3a7 |
13 | 4a9c85abca |
14 | 269a069115 |
15 | 14ea04b557 |
hex | bebd2c9af |
51201100207 has 2 divisors, whose sum is σ = 51201100208. Its totient is φ = 51201100206.
The previous prime is 51201100199. The next prime is 51201100261. The reversal of 51201100207 is 70200110215.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51201100207 - 23 = 51201100199 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51201106207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25600550103 + 25600550104.
It is an arithmetic number, because the mean of its divisors is an integer number (25600550104).
Almost surely, 251201100207 is an apocalyptic number.
51201100207 is a deficient number, since it is larger than the sum of its proper divisors (1).
51201100207 is an equidigital number, since it uses as much as digits as its factorization.
51201100207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
The spelling of 51201100207 in words is "fifty-one billion, two hundred one million, one hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •