Base | Representation |
---|---|
bin | 11001000010001010111001… |
… | …01111000010001101111001 |
3 | 21012220202001201111000120122 |
4 | 30201011130233002031321 |
5 | 24203420202311312203 |
6 | 313025405054103025 |
7 | 14411146035336461 |
oct | 1441053457021571 |
9 | 235822051430518 |
10 | 55050151666553 |
11 | 165a4702508a5a |
12 | 62111084aaa75 |
13 | 249428caba584 |
14 | d846278c0ba1 |
15 | 656eaa1d4538 |
hex | 32115cbc2379 |
55050151666553 has 2 divisors, whose sum is σ = 55050151666554. Its totient is φ = 55050151666552.
The previous prime is 55050151666429. The next prime is 55050151666589. The reversal of 55050151666553 is 35566615105055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46131644352784 + 8918507313769 = 6792028^2 + 2986387^2 .
It is a cyclic number.
It is not a de Polignac number, because 55050151666553 - 216 = 55050151601017 is a prime.
It is a super-3 number, since 3×550501516665533 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55050151666495 and 55050151666504.
It is not a weakly prime, because it can be changed into another prime (55050159666553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27525075833276 + 27525075833277.
It is an arithmetic number, because the mean of its divisors is an integer number (27525075833277).
Almost surely, 255050151666553 is an apocalyptic number.
It is an amenable number.
55050151666553 is a deficient number, since it is larger than the sum of its proper divisors (1).
55050151666553 is an equidigital number, since it uses as much as digits as its factorization.
55050151666553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10125000, while the sum is 53.
The spelling of 55050151666553 in words is "fifty-five trillion, fifty billion, one hundred fifty-one million, six hundred sixty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •