Base | Representation |
---|---|
bin | 110000010000110010100110… |
… | …0010101101010101111100011 |
3 | 2001200002201200200201021122022 |
4 | 1200201211030111222233203 |
5 | 421120314223133034301 |
6 | 4102513510030132055 |
7 | 155263365616451411 |
oct | 14041451425525743 |
9 | 2050081620637568 |
10 | 424520143252451 |
11 | 1132a0a88715474 |
12 | 3b742a2105102b |
13 | 152b5101a2b46c |
14 | 76b8c553602b1 |
15 | 3412b231b8d1b |
hex | 182194c56abe3 |
424520143252451 has 2 divisors, whose sum is σ = 424520143252452. Its totient is φ = 424520143252450.
The previous prime is 424520143252417. The next prime is 424520143252453. The reversal of 424520143252451 is 154252341025424.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 424520143252451 - 210 = 424520143251427 is a prime.
Together with 424520143252453, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (424520143252453) 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, 212260071626225 + 212260071626226.
It is an arithmetic number, because the mean of its divisors is an integer number (212260071626226).
Almost surely, 2424520143252451 is an apocalyptic number.
424520143252451 is a deficient number, since it is larger than the sum of its proper divisors (1).
424520143252451 is an equidigital number, since it uses as much as digits as its factorization.
424520143252451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536000, while the sum is 44.
Adding to 424520143252451 its reverse (154252341025424), we get a palindrome (578772484277875).
The spelling of 424520143252451 in words is "four hundred twenty-four trillion, five hundred twenty billion, one hundred forty-three million, two hundred fifty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •