Base | Representation |
---|---|
bin | 10000000000111110010… |
… | …10011110010101011011 |
3 | 1221121100212100221022001 |
4 | 20000133022132111123 |
5 | 33003432313401100 |
6 | 1100443341141431 |
7 | 54520263243331 |
oct | 10003712362533 |
9 | 1847325327261 |
10 | 550278653275 |
11 | 1a240aa5490a |
12 | 8a79325a877 |
13 | 3cb778531a0 |
14 | 1c8c296bb51 |
15 | e4a9bbbd6a |
hex | 801f29e55b |
550278653275 has 96 divisors (see below), whose sum is σ = 768522061440. Its totient is φ = 388062904320.
The previous prime is 550278653261. The next prime is 550278653347. The reversal of 550278653275 is 572356872055.
550278653275 is a nontrivial binomial coefficient, being equal to C(1049075, 2).
It is not a de Polignac number, because 550278653275 - 219 = 550278128987 is a prime.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 380288602 + ... + 380290048.
It is an arithmetic number, because the mean of its divisors is an integer number (8005438140).
Almost surely, 2550278653275 is an apocalyptic number.
550278653275 is the 1049074-th triangular number.
550278653275 is the 349692-nd centered nonagonal number.
550278653275 is a deficient number, since it is larger than the sum of its proper divisors (218243408165).
550278653275 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (550278653274) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (1908).
550278653275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1913 (or 1908 counting only the distinct ones).
The product of its (nonzero) digits is 17640000, while the sum is 55.
The spelling of 550278653275 in words is "five hundred fifty billion, two hundred seventy-eight million, six hundred fifty-three thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •