Base | Representation |
---|---|
bin | 10000000100110010010… |
… | …10000001000000110001 |
3 | 1221210122111121002012212 |
4 | 20002121022001000301 |
5 | 33022130242303041 |
6 | 1101422413101505 |
7 | 54622065020414 |
oct | 10023112010061 |
9 | 1853574532185 |
10 | 552325353521 |
11 | 1a3270299017 |
12 | 8b064787895 |
13 | 4011289ba16 |
14 | 1ca38701b7b |
15 | e5797068eb |
hex | 8099281031 |
552325353521 has 2 divisors, whose sum is σ = 552325353522. Its totient is φ = 552325353520.
The previous prime is 552325353491. The next prime is 552325353539. The reversal of 552325353521 is 125353523255.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 550029889600 + 2295463921 = 741640^2 + 47911^2 .
It is a cyclic number.
It is not a de Polignac number, because 552325353521 - 218 = 552325091377 is a prime.
It is a super-2 number, since 2×5523253535212 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (552325353551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276162676760 + 276162676761.
It is an arithmetic number, because the mean of its divisors is an integer number (276162676761).
Almost surely, 2552325353521 is an apocalyptic number.
It is an amenable number.
552325353521 is a deficient number, since it is larger than the sum of its proper divisors (1).
552325353521 is an equidigital number, since it uses as much as digits as its factorization.
552325353521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 675000, while the sum is 41.
Adding to 552325353521 its reverse (125353523255), we get a palindrome (677678876776).
The spelling of 552325353521 in words is "five hundred fifty-two billion, three hundred twenty-five million, three hundred fifty-three thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •