Base | Representation |
---|---|
bin | 10111010011010010001000… |
… | …01101001011001000010111 |
3 | 20201102111122221220001021222 |
4 | 23221221010031023020113 |
5 | 23204004213130123211 |
6 | 300551213501000555 |
7 | 13535655355634015 |
oct | 1351510415131027 |
9 | 221374587801258 |
10 | 51240104145431 |
11 | 15365895a66223 |
12 | 58b681325315b |
13 | 2278bc8825846 |
14 | c9206a08d8b5 |
15 | 5dcd155551db |
hex | 2e9a4434b217 |
51240104145431 has 2 divisors, whose sum is σ = 51240104145432. Its totient is φ = 51240104145430.
The previous prime is 51240104145427. The next prime is 51240104145473. The reversal of 51240104145431 is 13454140104215.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51240104145431 - 22 = 51240104145427 is a prime.
It is a super-2 number, since 2×512401041454312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51240104145391 and 51240104145400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51240104145481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25620052072715 + 25620052072716.
It is an arithmetic number, because the mean of its divisors is an integer number (25620052072716).
Almost surely, 251240104145431 is an apocalyptic number.
51240104145431 is a deficient number, since it is larger than the sum of its proper divisors (1).
51240104145431 is an equidigital number, since it uses as much as digits as its factorization.
51240104145431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 51240104145431 its reverse (13454140104215), we get a palindrome (64694244249646).
The spelling of 51240104145431 in words is "fifty-one trillion, two hundred forty billion, one hundred four million, one hundred forty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •