Base | Representation |
---|---|
bin | 101000001011011110011… |
… | …0011010011100011010001 |
3 | 201112220202122120012012112 |
4 | 1100112330303103203101 |
5 | 1210433431314311033 |
6 | 15424510334235105 |
7 | 1106652164061134 |
oct | 120267463234321 |
9 | 21486678505175 |
10 | 5522200541393 |
11 | 1839a52273328 |
12 | 7522a5955a95 |
13 | 31098377a863 |
14 | 1513c123021b |
15 | 989a2397c48 |
hex | 505bccd38d1 |
5522200541393 has 2 divisors, whose sum is σ = 5522200541394. Its totient is φ = 5522200541392.
The previous prime is 5522200541387. The next prime is 5522200541441. The reversal of 5522200541393 is 3931450022255.
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., 4972418331664 + 549782209729 = 2229892^2 + 741473^2 .
It is a cyclic number.
It is not a de Polignac number, because 5522200541393 - 224 = 5522183764177 is a prime.
It is a super-2 number, since 2×55222005413932 (a number of 26 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 5522200541393.
It is not a weakly prime, because it can be changed into another prime (5522200541593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2761100270696 + 2761100270697.
It is an arithmetic number, because the mean of its divisors is an integer number (2761100270697).
Almost surely, 25522200541393 is an apocalyptic number.
It is an amenable number.
5522200541393 is a deficient number, since it is larger than the sum of its proper divisors (1).
5522200541393 is an equidigital number, since it uses as much as digits as its factorization.
5522200541393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 5522200541393 in words is "five trillion, five hundred twenty-two billion, two hundred million, five hundred forty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •