Base | Representation |
---|---|
bin | 10000000001111000010… |
… | …11111001110001001111 |
3 | 1221122121210120201102202 |
4 | 20000330023321301033 |
5 | 33010431441121210 |
6 | 1101003533312115 |
7 | 54535325035124 |
oct | 10007413716117 |
9 | 1848553521382 |
10 | 550765567055 |
11 | 1a263a8933a0 |
12 | 8a8aa33563b |
13 | 3cc246a5a52 |
14 | 1c92b4b874b |
15 | e4d77ec9a5 |
hex | 803c2f9c4f |
550765567055 has 8 divisors (see below), whose sum is σ = 721002196944. Its totient is φ = 400556776000.
The previous prime is 550765567043. The next prime is 550765567057.
It is a happy number.
550765567055 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550765567055 - 212 = 550765562959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550765567057) 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 in 7 ways as a sum of consecutive naturals, for example, 5006959646 + ... + 5006959755.
It is an arithmetic number, because the mean of its divisors is an integer number (90125274618).
Almost surely, 2550765567055 is an apocalyptic number.
550765567055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
550765567055 is a deficient number, since it is larger than the sum of its proper divisors (170236629889).
550765567055 is a wasteful number, since it uses less digits than its factorization.
550765567055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10013919417.
The product of its (nonzero) digits is 27562500, while the sum is 56.
The spelling of 550765567055 in words is "five hundred fifty billion, seven hundred sixty-five million, five hundred sixty-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •