Base | Representation |
---|---|
bin | 10111001111001111000111… |
… | …11011111010101100110111 |
3 | 20200221012202001002101012021 |
4 | 23213213203323322230313 |
5 | 23144214422303233404 |
6 | 300403255345134011 |
7 | 13522633441444654 |
oct | 1347474373725467 |
9 | 220835661071167 |
10 | 51101050055479 |
11 | 15311919611326 |
12 | 589388632a307 |
13 | 2268a67c12b48 |
14 | c8943832cc2b |
15 | 5d93c78cd454 |
hex | 2e79e3efab37 |
51101050055479 has 2 divisors, whose sum is σ = 51101050055480. Its totient is φ = 51101050055478.
The previous prime is 51101050055371. The next prime is 51101050055509. The reversal of 51101050055479 is 97455005010115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51101050055479 - 245 = 15916677966647 is a prime.
It is a super-2 number, since 2×511010500554792 (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 (51101050085479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25550525027739 + 25550525027740.
It is an arithmetic number, because the mean of its divisors is an integer number (25550525027740).
Almost surely, 251101050055479 is an apocalyptic number.
51101050055479 is a deficient number, since it is larger than the sum of its proper divisors (1).
51101050055479 is an equidigital number, since it uses as much as digits as its factorization.
51101050055479 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 43.
The spelling of 51101050055479 in words is "fifty-one trillion, one hundred one billion, fifty million, fifty-five thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •