Base | Representation |
---|---|
bin | 10111010000001100101100… |
… | …10001011001010100111101 |
3 | 20201001101001211012001202211 |
4 | 23220012112101121110331 |
5 | 23200240122320121334 |
6 | 300430403454020421 |
7 | 13525213556241466 |
oct | 1350062621312475 |
9 | 221041054161684 |
10 | 51134106801469 |
11 | 1532494225390a |
12 | 589a170aa7711 |
13 | 226bc0566a283 |
14 | c8ac92711d6d |
15 | 5da1aea59a64 |
hex | 2e819645953d |
51134106801469 has 2 divisors, whose sum is σ = 51134106801470. Its totient is φ = 51134106801468.
The previous prime is 51134106801383. The next prime is 51134106801517. The reversal of 51134106801469 is 96410860143115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28508530278244 + 22625576523225 = 5339338^2 + 4756635^2 .
It is a cyclic number.
It is not a de Polignac number, because 51134106801469 - 229 = 51133569930557 is a prime.
It is a super-3 number, since 3×511341068014693 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51134106805469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25567053400734 + 25567053400735.
It is an arithmetic number, because the mean of its divisors is an integer number (25567053400735).
Almost surely, 251134106801469 is an apocalyptic number.
It is an amenable number.
51134106801469 is a deficient number, since it is larger than the sum of its proper divisors (1).
51134106801469 is an equidigital number, since it uses as much as digits as its factorization.
51134106801469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 622080, while the sum is 49.
The spelling of 51134106801469 in words is "fifty-one trillion, one hundred thirty-four billion, one hundred six million, eight hundred one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •