Base | Representation |
---|---|
bin | 111010011100111001001010… |
… | …0010000100010001110110011 |
3 | 2111102102201122111121100122021 |
4 | 1310321302110100202032303 |
5 | 1014342220244200311201 |
6 | 5021254405213052311 |
7 | 213203465222051131 |
oct | 16471622420421663 |
9 | 2442381574540567 |
10 | 514144432432051 |
11 | 13990547a432383 |
12 | 497b8776187097 |
13 | 190b67c5586885 |
14 | 90d6a1aa74751 |
15 | 3e69123710ea1 |
hex | 1d39c944223b3 |
514144432432051 has 2 divisors, whose sum is σ = 514144432432052. Its totient is φ = 514144432432050.
The previous prime is 514144432431991. The next prime is 514144432432067. The reversal of 514144432432051 is 150234234441415.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 514144432432051 - 241 = 511945409176499 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 514144432431989 and 514144432432007.
It is not a weakly prime, because it can be changed into another prime (514144432439051) 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 as a sum of consecutive naturals, namely, 257072216216025 + 257072216216026.
It is an arithmetic number, because the mean of its divisors is an integer number (257072216216026).
Almost surely, 2514144432432051 is an apocalyptic number.
514144432432051 is a deficient number, since it is larger than the sum of its proper divisors (1).
514144432432051 is an equidigital number, since it uses as much as digits as its factorization.
514144432432051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 921600, while the sum is 43.
Adding to 514144432432051 its reverse (150234234441415), we get a palindrome (664378666873466).
The spelling of 514144432432051 in words is "five hundred fourteen trillion, one hundred forty-four billion, four hundred thirty-two million, four hundred thirty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •