Base | Representation |
---|---|
bin | 11001001010001000010110… |
… | …01111000110000011100001 |
3 | 21020212220001010220001202211 |
4 | 30211010023033012003201 |
5 | 24222410330013333423 |
6 | 313355201203042121 |
7 | 14440000632035122 |
oct | 1445041317060341 |
9 | 236786033801684 |
10 | 55323662246113 |
11 | 1669a6a7064648 |
12 | 625611a670341 |
13 | 24b3cca955cb1 |
14 | d9397292c049 |
15 | 65e16706610d |
hex | 32510b3c60e1 |
55323662246113 has 2 divisors, whose sum is σ = 55323662246114. Its totient is φ = 55323662246112.
The previous prime is 55323662246081. The next prime is 55323662246183. The reversal of 55323662246113 is 31164226632355.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 55307080018129 + 16582227984 = 7436873^2 + 128772^2 .
It is a cyclic number.
It is not a de Polignac number, because 55323662246113 - 25 = 55323662246081 is a prime.
It is not a weakly prime, because it can be changed into another prime (55323662246183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27661831123056 + 27661831123057.
It is an arithmetic number, because the mean of its divisors is an integer number (27661831123057).
Almost surely, 255323662246113 is an apocalyptic number.
It is an amenable number.
55323662246113 is a deficient number, since it is larger than the sum of its proper divisors (1).
55323662246113 is an equidigital number, since it uses as much as digits as its factorization.
55323662246113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4665600, while the sum is 49.
Adding to 55323662246113 its reverse (31164226632355), we get a palindrome (86487888878468).
The spelling of 55323662246113 in words is "fifty-five trillion, three hundred twenty-three billion, six hundred sixty-two million, two hundred forty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •