Base | Representation |
---|---|
bin | 111100101111011101011011… |
… | …0111101100010100101000101 |
3 | 2121001202110210000122211110211 |
4 | 1321132322312331202211011 |
5 | 1030012240131241223131 |
6 | 5132200412505315421 |
7 | 220353030623053231 |
oct | 17136726675424505 |
9 | 2531673700584424 |
10 | 534288411273541 |
11 | 145271496326001 |
12 | 4bb1080ba95b71 |
13 | 19c18247853472 |
14 | 95d19a8b275c1 |
15 | 41b810375e5b1 |
hex | 1e5eeb6f62945 |
534288411273541 has 2 divisors, whose sum is σ = 534288411273542. Its totient is φ = 534288411273540.
The previous prime is 534288411273403. The next prime is 534288411273587. The reversal of 534288411273541 is 145372114882435.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 504052115721025 + 30236295552516 = 22451105^2 + 5498754^2 .
It is a cyclic number.
It is not a de Polignac number, because 534288411273541 - 223 = 534288402884933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (534288411273041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 267144205636770 + 267144205636771.
It is an arithmetic number, because the mean of its divisors is an integer number (267144205636771).
Almost surely, 2534288411273541 is an apocalyptic number.
It is an amenable number.
534288411273541 is a deficient number, since it is larger than the sum of its proper divisors (1).
534288411273541 is an equidigital number, since it uses as much as digits as its factorization.
534288411273541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25804800, while the sum is 58.
The spelling of 534288411273541 in words is "five hundred thirty-four trillion, two hundred eighty-eight billion, four hundred eleven million, two hundred seventy-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •