Base | Representation |
---|---|
bin | 11001000010010011111011… |
… | …11000100100000110011101 |
3 | 21012221012120210201010021022 |
4 | 30201021331320210012131 |
5 | 24204010121202430221 |
6 | 313031530310213525 |
7 | 14411410202202524 |
oct | 1441117570440635 |
9 | 235835523633238 |
10 | 55055002780061 |
11 | 165a6771874379 |
12 | 62120410542a5 |
13 | 2494883b4a03b |
14 | d84967ca74bb |
15 | 65719102b4ab |
hex | 32127de2419d |
55055002780061 has 2 divisors, whose sum is σ = 55055002780062. Its totient is φ = 55055002780060.
The previous prime is 55055002780051. The next prime is 55055002780087. The reversal of 55055002780061 is 16008720055055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54848687880100 + 206314899961 = 7405990^2 + 454219^2 .
It is a cyclic number.
It is not a de Polignac number, because 55055002780061 - 218 = 55055002517917 is a prime.
It is a super-2 number, since 2×550550027800612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55055002779994 and 55055002780021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55055002780021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27527501390030 + 27527501390031.
It is an arithmetic number, because the mean of its divisors is an integer number (27527501390031).
Almost surely, 255055002780061 is an apocalyptic number.
It is an amenable number.
55055002780061 is a deficient number, since it is larger than the sum of its proper divisors (1).
55055002780061 is an equidigital number, since it uses as much as digits as its factorization.
55055002780061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 420000, while the sum is 44.
The spelling of 55055002780061 in words is "fifty-five trillion, fifty-five billion, two million, seven hundred eighty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •