Base | Representation |
---|---|
bin | 111110101001011010110000… |
… | …1111011111000000101010101 |
3 | 2200021002212222211120222221201 |
4 | 1331102311201323320011111 |
5 | 1034211401343441132021 |
6 | 5231552553024512501 |
7 | 224033031462404656 |
oct | 17522654173700525 |
9 | 2607085884528851 |
10 | 551050242130261 |
11 | 14a644105917955 |
12 | 5197928b17b731 |
13 | 1a862a7933a853 |
14 | 9a10d8ca2952d |
15 | 43a9134a46591 |
hex | 1f52d61ef8155 |
551050242130261 has 2 divisors, whose sum is σ = 551050242130262. Its totient is φ = 551050242130260.
The previous prime is 551050242130189. The next prime is 551050242130291. The reversal of 551050242130261 is 162031242050155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 509434918542225 + 41615323588036 = 22570665^2 + 6450994^2 .
It is a cyclic number.
It is not a de Polignac number, because 551050242130261 - 221 = 551050240033109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 551050242130261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (551050242130291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275525121065130 + 275525121065131.
It is an arithmetic number, because the mean of its divisors is an integer number (275525121065131).
Almost surely, 2551050242130261 is an apocalyptic number.
It is an amenable number.
551050242130261 is a deficient number, since it is larger than the sum of its proper divisors (1).
551050242130261 is an equidigital number, since it uses as much as digits as its factorization.
551050242130261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 551050242130261 in words is "five hundred fifty-one trillion, fifty billion, two hundred forty-two million, one hundred thirty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •