Base | Representation |
---|---|
bin | 111100110111001000000111… |
… | …0101011111111010010101001 |
3 | 2121012111012122220002012200002 |
4 | 1321232100032223333102221 |
5 | 1030132021210403230311 |
6 | 5134324442200352345 |
7 | 220522123351653605 |
oct | 17156201653772251 |
9 | 2535435586065602 |
10 | 535342150055081 |
11 | 145638370401946 |
12 | 50060a8aa756b5 |
13 | 19c93718340695 |
14 | 962a9ac258505 |
15 | 41d5727be293b |
hex | 1e6e40eaff4a9 |
535342150055081 has 2 divisors, whose sum is σ = 535342150055082. Its totient is φ = 535342150055080.
The previous prime is 535342150054981. The next prime is 535342150055093. The reversal of 535342150055081 is 180550051243535.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 470294957101225 + 65047192953856 = 21686285^2 + 8065184^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-535342150055081 is a prime.
It is a super-2 number, since 2×5353421500550812 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (535342150052081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 267671075027540 + 267671075027541.
It is an arithmetic number, because the mean of its divisors is an integer number (267671075027541).
Almost surely, 2535342150055081 is an apocalyptic number.
It is an amenable number.
535342150055081 is a deficient number, since it is larger than the sum of its proper divisors (1).
535342150055081 is an equidigital number, since it uses as much as digits as its factorization.
535342150055081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800000, while the sum is 47.
The spelling of 535342150055081 in words is "five hundred thirty-five trillion, three hundred forty-two billion, one hundred fifty million, fifty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •