Base | Representation |
---|---|
bin | 10111010111000111111000… |
… | …00000010100010100110111 |
3 | 20201220010012120110102010001 |
4 | 23223203330000110110313 |
5 | 23213134412410124342 |
6 | 301131553215412131 |
7 | 13551335651002126 |
oct | 1353437400242467 |
9 | 221803176412101 |
10 | 51372036801847 |
11 | 15406838565763 |
12 | 59182b3224047 |
13 | 2288492c26048 |
14 | c985c40c3abd |
15 | 5e1487dc78b7 |
hex | 2eb8fc014537 |
51372036801847 has 2 divisors, whose sum is σ = 51372036801848. Its totient is φ = 51372036801846.
The previous prime is 51372036801769. The next prime is 51372036801863. The reversal of 51372036801847 is 74810863027315.
51372036801847 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51372036801847 - 243 = 42575943779639 is a prime.
It is a super-2 number, since 2×513720368018472 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51372036801887) 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, 25686018400923 + 25686018400924.
It is an arithmetic number, because the mean of its divisors is an integer number (25686018400924).
Almost surely, 251372036801847 is an apocalyptic number.
51372036801847 is a deficient number, since it is larger than the sum of its proper divisors (1).
51372036801847 is an equidigital number, since it uses as much as digits as its factorization.
51372036801847 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6773760, while the sum is 55.
The spelling of 51372036801847 in words is "fifty-one trillion, three hundred seventy-two billion, thirty-six million, eight hundred one thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •