Base | Representation |
---|---|
bin | 100000110101011… |
… | …010011110000001 |
3 | 1102101120020122021 |
4 | 200311122132001 |
5 | 2112010413321 |
6 | 130355041441 |
7 | 16436225422 |
oct | 4065323601 |
9 | 1371506567 |
10 | 550872961 |
11 | 262a54011 |
12 | 1345a0281 |
13 | 8a187942 |
14 | 53239649 |
15 | 33566941 |
hex | 20d5a781 |
550872961 has 4 divisors (see below), whose sum is σ = 551018500. Its totient is φ = 550727424.
The previous prime is 550872953. The next prime is 550872989. The reversal of 550872961 is 169278055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 482065936 + 68807025 = 21956^2 + 8295^2 .
It is a cyclic number.
It is not a de Polignac number, because 550872961 - 23 = 550872953 is a prime.
It is a super-2 number, since 2×5508729612 = 606922038321815042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550872941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66936 + ... + 74713.
It is an arithmetic number, because the mean of its divisors is an integer number (137754625).
Almost surely, 2550872961 is an apocalyptic number.
It is an amenable number.
550872961 is a deficient number, since it is larger than the sum of its proper divisors (145539).
550872961 is a wasteful number, since it uses less digits than its factorization.
550872961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145538.
The product of its (nonzero) digits is 151200, while the sum is 43.
The square root of 550872961 is about 23470.6830109394. The cubic root of 550872961 is about 819.7545175348.
The spelling of 550872961 in words is "five hundred fifty million, eight hundred seventy-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •