Base | Representation |
---|---|
bin | 10111011010101001011101… |
… | …11100100000110100101001 |
3 | 20202022200211012022002222101 |
4 | 23231110232330200310221 |
5 | 23222130433013324021 |
6 | 301303343215053401 |
7 | 13563154162453006 |
oct | 1355245674406451 |
9 | 222280735262871 |
10 | 51493150526761 |
11 | 15453139059899 |
12 | 5937873b11261 |
13 | 2296a24a88228 |
14 | ca03d32dc8ad |
15 | 5e46c5a25a91 |
hex | 2ed52ef20d29 |
51493150526761 has 4 divisors (see below), whose sum is σ = 53154219898624. Its totient is φ = 49832081154900.
The previous prime is 51493150526723. The next prime is 51493150526837. The reversal of 51493150526761 is 16762505139415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51493150526761 - 211 = 51493150524713 is a prime.
It is a super-2 number, since 2×514931505267612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51493150526861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 830534685885 + ... + 830534685946.
It is an arithmetic number, because the mean of its divisors is an integer number (13288554974656).
Almost surely, 251493150526761 is an apocalyptic number.
It is an amenable number.
51493150526761 is a deficient number, since it is larger than the sum of its proper divisors (1661069371863).
51493150526761 is a wasteful number, since it uses less digits than its factorization.
51493150526761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1661069371862.
The product of its (nonzero) digits is 6804000, while the sum is 55.
The spelling of 51493150526761 in words is "fifty-one trillion, four hundred ninety-three billion, one hundred fifty million, five hundred twenty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •