Base | Representation |
---|---|
bin | 10111100010100010011101… |
… | …01000110000010111111001 |
3 | 20210021121121122022101010221 |
4 | 23301101032220300113321 |
5 | 23241101203340030022 |
6 | 302032101454340041 |
7 | 13621562514011560 |
oct | 1361211650602771 |
9 | 223247548271127 |
10 | 51764265158137 |
11 | 15548113210114 |
12 | 59803177ba621 |
13 | 22b647042632c |
14 | cad592062bd7 |
15 | 5eb792381cc7 |
hex | 2f144ea305f9 |
51764265158137 has 16 divisors (see below), whose sum is σ = 62972494588800. Its totient is φ = 41561846409600.
The previous prime is 51764265158101. The next prime is 51764265158149. The reversal of 51764265158137 is 73185156246715.
51764265158137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51764265158137 - 223 = 51764256769529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51764265158197) 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 in 15 ways as a sum of consecutive naturals, for example, 2186533114 + ... + 2186556787.
It is an arithmetic number, because the mean of its divisors is an integer number (3935780911800).
Almost surely, 251764265158137 is an apocalyptic number.
It is an amenable number.
51764265158137 is a deficient number, since it is larger than the sum of its proper divisors (11208229430663).
51764265158137 is a wasteful number, since it uses less digits than its factorization.
51764265158137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4373090016.
The product of its digits is 42336000, while the sum is 61.
The spelling of 51764265158137 in words is "fifty-one trillion, seven hundred sixty-four billion, two hundred sixty-five million, one hundred fifty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •