Base | Representation |
---|---|
bin | 101111100111101010… |
… | …011100111100000101 |
3 | 11212222102120110100012 |
4 | 233213222130330011 |
5 | 1314204103240413 |
6 | 35253413200005 |
7 | 3460036633124 |
oct | 574752347405 |
9 | 155872513305 |
10 | 51131305733 |
11 | 1a75931a872 |
12 | 9aab930005 |
13 | 4a8b261ac1 |
14 | 2690a9babb |
15 | 14e3d617a8 |
hex | be7a9cf05 |
51131305733 has 2 divisors, whose sum is σ = 51131305734. Its totient is φ = 51131305732.
The previous prime is 51131305723. The next prime is 51131305793. The reversal of 51131305733 is 33750313115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50419109764 + 712195969 = 224542^2 + 26687^2 .
It is a cyclic number.
It is not a de Polignac number, because 51131305733 - 228 = 50862870277 is a prime.
It is a super-2 number, since 2×511313057332 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51131305733.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51131305723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25565652866 + 25565652867.
It is an arithmetic number, because the mean of its divisors is an integer number (25565652867).
Almost surely, 251131305733 is an apocalyptic number.
It is an amenable number.
51131305733 is a deficient number, since it is larger than the sum of its proper divisors (1).
51131305733 is an equidigital number, since it uses as much as digits as its factorization.
51131305733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14175, while the sum is 32.
Adding to 51131305733 its reverse (33750313115), we get a palindrome (84881618848).
The spelling of 51131305733 in words is "fifty-one billion, one hundred thirty-one million, three hundred five thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •