Base | Representation |
---|---|
bin | 111110100101101001100011… |
… | …1111011011000101110101111 |
3 | 2200012021100222221000222021112 |
4 | 1331023103013323120232233 |
5 | 1034124410033113010210 |
6 | 5230515010234022235 |
7 | 223650433451056622 |
oct | 17513230773305657 |
9 | 2605240887028245 |
10 | 550532262235055 |
11 | 14a46446a75a031 |
12 | 518b4a1087797b |
13 | 1a825c7b1ab539 |
14 | 99d3c9192ddb9 |
15 | 439a91a6cbd05 |
hex | 1f4b4c7ed8baf |
550532262235055 has 16 divisors (see below), whose sum is σ = 668074188386304. Its totient is φ = 435496442821920.
The previous prime is 550532262235051. The next prime is 550532262235063.
550532262235055 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 550532262235055 - 22 = 550532262235051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 550532262234994 and 550532262235012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550532262235051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1725809297 + ... + 1726128266.
It is an arithmetic number, because the mean of its divisors is an integer number (41754636774144).
Almost surely, 2550532262235055 is an apocalyptic number.
550532262235055 is a deficient number, since it is larger than the sum of its proper divisors (117541926151249).
550532262235055 is a wasteful number, since it uses less digits than its factorization.
550532262235055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3451937926.
The product of its (nonzero) digits is 13500000, while the sum is 50.
The spelling of 550532262235055 in words is "five hundred fifty trillion, five hundred thirty-two billion, two hundred sixty-two million, two hundred thirty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •