Base | Representation |
---|---|
bin | 111110110011011101011000… |
… | …0001110011001111010010001 |
3 | 2200102222211000021021000000112 |
4 | 1331212322300032121322101 |
5 | 1034402004112432043043 |
6 | 5234530540534531105 |
7 | 224234524223614535 |
oct | 17546726016317221 |
9 | 2612884007230015 |
10 | 552430240112273 |
11 | 150026392797a66 |
12 | 51b60821806a95 |
13 | 1a932c43011403 |
14 | 9a5baa2985bc5 |
15 | 43ceea1b8c518 |
hex | 1f66eb0399e91 |
552430240112273 has 2 divisors, whose sum is σ = 552430240112274. Its totient is φ = 552430240112272.
The previous prime is 552430240112227. The next prime is 552430240112357. The reversal of 552430240112273 is 372211042034255.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 437862823229584 + 114567416882689 = 20925172^2 + 10703617^2 .
It is a cyclic number.
It is not a de Polignac number, because 552430240112273 - 212 = 552430240108177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 552430240112273.
It is not a weakly prime, because it can be changed into another prime (552430240412273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276215120056136 + 276215120056137.
It is an arithmetic number, because the mean of its divisors is an integer number (276215120056137).
Almost surely, 2552430240112273 is an apocalyptic number.
It is an amenable number.
552430240112273 is a deficient number, since it is larger than the sum of its proper divisors (1).
552430240112273 is an equidigital number, since it uses as much as digits as its factorization.
552430240112273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 41.
The spelling of 552430240112273 in words is "five hundred fifty-two trillion, four hundred thirty billion, two hundred forty million, one hundred twelve thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •