Base | Representation |
---|---|
bin | 10000000110100010101… |
… | …10101010010010111001 |
3 | 1221220002012201021001212 |
4 | 20003101112222102321 |
5 | 33031043124124231 |
6 | 1102100133252505 |
7 | 54654334020056 |
oct | 10032126522271 |
9 | 1856065637055 |
10 | 553268192441 |
11 | 1a370451a938 |
12 | 8b288494135 |
13 | 40233014183 |
14 | 1cac7a1002d |
15 | e5d239642b |
hex | 80d15aa4b9 |
553268192441 has 2 divisors, whose sum is σ = 553268192442. Its totient is φ = 553268192440.
The previous prime is 553268192381. The next prime is 553268192459. The reversal of 553268192441 is 144291862355.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 422968129600 + 130300062841 = 650360^2 + 360971^2 .
It is a cyclic number.
It is not a de Polignac number, because 553268192441 - 226 = 553201083577 is a prime.
It is a super-2 number, since 2×5532681924412 (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 553268192441.
It is not a weakly prime, because it can be changed into another prime (553268192461) 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, 276634096220 + 276634096221.
It is an arithmetic number, because the mean of its divisors is an integer number (276634096221).
Almost surely, 2553268192441 is an apocalyptic number.
It is an amenable number.
553268192441 is a deficient number, since it is larger than the sum of its proper divisors (1).
553268192441 is an equidigital number, since it uses as much as digits as its factorization.
553268192441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2073600, while the sum is 50.
The spelling of 553268192441 in words is "five hundred fifty-three billion, two hundred sixty-eight million, one hundred ninety-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •