Base | Representation |
---|---|
bin | 101111100001010101… |
… | …011101110000011111 |
3 | 11212201000210201101102 |
4 | 233201111131300133 |
5 | 1313444414001032 |
6 | 35235101503315 |
7 | 3454310353226 |
oct | 574125356037 |
9 | 155630721342 |
10 | 51025140767 |
11 | 1a7043a8527 |
12 | 9a80271b3b |
13 | 4a722701b3 |
14 | 2680943cbd |
15 | 14d9890362 |
hex | be155dc1f |
51025140767 has 2 divisors, whose sum is σ = 51025140768. Its totient is φ = 51025140766.
The previous prime is 51025140679. The next prime is 51025140779. The reversal of 51025140767 is 76704152015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51025140767 - 226 = 50958031903 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51025140767.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51025140797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25512570383 + 25512570384.
It is an arithmetic number, because the mean of its divisors is an integer number (25512570384).
Almost surely, 251025140767 is an apocalyptic number.
51025140767 is a deficient number, since it is larger than the sum of its proper divisors (1).
51025140767 is an equidigital number, since it uses as much as digits as its factorization.
51025140767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58800, while the sum is 38.
The spelling of 51025140767 in words is "fifty-one billion, twenty-five million, one hundred forty thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •