Base | Representation |
---|---|
bin | 111100110000011100000110… |
… | …1001101100101000000100111 |
3 | 2121002020100011220102121200012 |
4 | 1321200320031031211000213 |
5 | 1030021441302042221201 |
6 | 5132342312110240435 |
7 | 220365534124666523 |
oct | 17140701515450047 |
9 | 2532210156377605 |
10 | 534423002304551 |
11 | 145313582470738 |
12 | 4bb329121b611b |
13 | 19c27b46924a99 |
14 | 95d82d5c36d83 |
15 | 41bb87e6935bb |
hex | 1e60e0d365027 |
534423002304551 has 2 divisors, whose sum is σ = 534423002304552. Its totient is φ = 534423002304550.
The previous prime is 534423002304479. The next prime is 534423002304553. The reversal of 534423002304551 is 155403200324435.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 534423002304551 - 226 = 534422935195687 is a prime.
Together with 534423002304553, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 534423002304499 and 534423002304508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (534423002304553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 267211501152275 + 267211501152276.
It is an arithmetic number, because the mean of its divisors is an integer number (267211501152276).
Almost surely, 2534423002304551 is an apocalyptic number.
534423002304551 is a deficient number, since it is larger than the sum of its proper divisors (1).
534423002304551 is an equidigital number, since it uses as much as digits as its factorization.
534423002304551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864000, while the sum is 41.
Adding to 534423002304551 its reverse (155403200324435), we get a palindrome (689826202628986).
The spelling of 534423002304551 in words is "five hundred thirty-four trillion, four hundred twenty-three billion, two million, three hundred four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •