Base | Representation |
---|---|
bin | 101111101001011000… |
… | …110011011010000001 |
3 | 11220001110000010220201 |
4 | 233221120303122001 |
5 | 1314234004433401 |
6 | 35300325205201 |
7 | 3460540545001 |
oct | 575130633201 |
9 | 156043003821 |
10 | 51160233601 |
11 | 1a7736887a4 |
12 | 9ab9560801 |
13 | 4a9424ca99 |
14 | 269486c001 |
15 | 14e6677b01 |
hex | be9633681 |
51160233601 has 2 divisors, whose sum is σ = 51160233602. Its totient is φ = 51160233600.
The previous prime is 51160233581. The next prime is 51160233647. The reversal of 51160233601 is 10633206115.
51160233601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39750789376 + 11409444225 = 199376^2 + 106815^2 .
It is a cyclic number.
It is not a de Polignac number, because 51160233601 - 213 = 51160225409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51160233601.
It is not a weakly prime, because it can be changed into another prime (51160233661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25580116800 + 25580116801.
It is an arithmetic number, because the mean of its divisors is an integer number (25580116801).
Almost surely, 251160233601 is an apocalyptic number.
It is an amenable number.
51160233601 is a deficient number, since it is larger than the sum of its proper divisors (1).
51160233601 is an equidigital number, since it uses as much as digits as its factorization.
51160233601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 51160233601 its reverse (10633206115), we get a palindrome (61793439716).
The spelling of 51160233601 in words is "fifty-one billion, one hundred sixty million, two hundred thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •