Base | Representation |
---|---|
bin | 111110110100010111110000… |
… | …0010001010111000110010101 |
3 | 2200110102210120211110120111112 |
4 | 1331220233200101113012111 |
5 | 1034411032332130321031 |
6 | 5235104312145344405 |
7 | 224246552610303503 |
oct | 17550574021270625 |
9 | 2613383524416445 |
10 | 552555600245141 |
11 | 150074572275259 |
12 | 51b80b88638105 |
13 | 1a941a0084a71c |
14 | 9a63b95b37673 |
15 | 43d338c4d562b |
hex | 1f68be0457195 |
552555600245141 has 2 divisors, whose sum is σ = 552555600245142. Its totient is φ = 552555600245140.
The previous prime is 552555600245023. The next prime is 552555600245153. The reversal of 552555600245141 is 141542006555255.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 492979647891025 + 59575952354116 = 22203145^2 + 7718546^2 .
It is a cyclic number.
It is not a de Polignac number, because 552555600245141 - 238 = 552280722338197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 552555600245141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (552555600235141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276277800122570 + 276277800122571.
It is an arithmetic number, because the mean of its divisors is an integer number (276277800122571).
Almost surely, 2552555600245141 is an apocalyptic number.
It is an amenable number.
552555600245141 is a deficient number, since it is larger than the sum of its proper divisors (1).
552555600245141 is an equidigital number, since it uses as much as digits as its factorization.
552555600245141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000000, while the sum is 50.
The spelling of 552555600245141 in words is "five hundred fifty-two trillion, five hundred fifty-five billion, six hundred million, two hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •