Base | Representation |
---|---|
bin | 10000000100110100001… |
… | …11110000110110110001 |
3 | 1221210200122001110021012 |
4 | 20002122013300312301 |
5 | 33022143413242043 |
6 | 1101424152040305 |
7 | 54622352425205 |
oct | 10023207606661 |
9 | 1853618043235 |
10 | 552341540273 |
11 | 1a32794443a6 |
12 | 8b06a093095 |
13 | 40116048593 |
14 | 1ca3a916b05 |
15 | e57ad52a18 |
hex | 809a1f0db1 |
552341540273 has 2 divisors, whose sum is σ = 552341540274. Its totient is φ = 552341540272.
The previous prime is 552341540227. The next prime is 552341540321. The reversal of 552341540273 is 372045143255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 485959563664 + 66381976609 = 697108^2 + 257647^2 .
It is a cyclic number.
It is not a de Polignac number, because 552341540273 - 220 = 552340491697 is a prime.
It is a super-2 number, since 2×5523415402732 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 552341540273.
It is not a weakly prime, because it can be changed into another prime (552341540213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276170770136 + 276170770137.
It is an arithmetic number, because the mean of its divisors is an integer number (276170770137).
Almost surely, 2552341540273 is an apocalyptic number.
It is an amenable number.
552341540273 is a deficient number, since it is larger than the sum of its proper divisors (1).
552341540273 is an equidigital number, since it uses as much as digits as its factorization.
552341540273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504000, while the sum is 41.
The spelling of 552341540273 in words is "five hundred fifty-two billion, three hundred forty-one million, five hundred forty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •