Base | Representation |
---|---|
bin | 100000110010001… |
… | …011011101100001 |
3 | 1102022222011112102 |
4 | 200302023131201 |
5 | 2111301300212 |
6 | 130324540145 |
7 | 16426064411 |
oct | 4062133541 |
9 | 1368864472 |
10 | 550025057 |
11 | 262524a6a |
12 | 134251655 |
13 | 89c4ba1a |
14 | 53098641 |
15 | 3344a5c2 |
hex | 20c8b761 |
550025057 has 4 divisors (see below), whose sum is σ = 550074900. Its totient is φ = 549975216.
The previous prime is 550025027. The next prime is 550025101. The reversal of 550025057 is 750520055.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 275261281 + 274763776 = 16591^2 + 16576^2 .
It is a cyclic number.
It is not a de Polignac number, because 550025057 - 214 = 550008673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550025027) 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, 182 + ... + 33167.
It is an arithmetic number, because the mean of its divisors is an integer number (137518725).
Almost surely, 2550025057 is an apocalyptic number.
It is an amenable number.
550025057 is a deficient number, since it is larger than the sum of its proper divisors (49843).
550025057 is a wasteful number, since it uses less digits than its factorization.
550025057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49842.
The product of its (nonzero) digits is 8750, while the sum is 29.
The square root of 550025057 is about 23452.6130100678. The cubic root of 550025057 is about 819.3337126742. Note that the first 3 decimals are identical.
The spelling of 550025057 in words is "five hundred fifty million, twenty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •