Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …00001111100000011010001 |
3 | 21012220202222000222101111112 |
4 | 30201011301201330003101 |
5 | 24203421411120224321 |
6 | 313025503440023105 |
7 | 14411160503004032 |
oct | 1441056141740321 |
9 | 235822860871445 |
10 | 55050500554961 |
11 | 165a4871443a8a |
12 | 62111a5301a95 |
13 | 2494317174812 |
14 | d8465bd7ca89 |
15 | 656ecab4da5b |
hex | 32117187c0d1 |
55050500554961 has 2 divisors, whose sum is σ = 55050500554962. Its totient is φ = 55050500554960.
The previous prime is 55050500554943. The next prime is 55050500554981. The reversal of 55050500554961 is 16945500505055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54677979535936 + 372521019025 = 7394456^2 + 610345^2 .
It is a cyclic number.
It is not a de Polignac number, because 55050500554961 - 214 = 55050500538577 is a prime.
It is a super-2 number, since 2×550505005549612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55050500554981) 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, 27525250277480 + 27525250277481.
It is an arithmetic number, because the mean of its divisors is an integer number (27525250277481).
Almost surely, 255050500554961 is an apocalyptic number.
It is an amenable number.
55050500554961 is a deficient number, since it is larger than the sum of its proper divisors (1).
55050500554961 is an equidigital number, since it uses as much as digits as its factorization.
55050500554961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3375000, while the sum is 50.
The spelling of 55050500554961 in words is "fifty-five trillion, fifty billion, five hundred million, five hundred fifty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •