Base | Representation |
---|---|
bin | 100000110100111… |
… | …101101100010101 |
3 | 1102101100020221210 |
4 | 200310331230111 |
5 | 2111443130333 |
6 | 130352332033 |
7 | 16435224660 |
oct | 4064755425 |
9 | 1371306853 |
10 | 550755093 |
11 | 2629834a9 |
12 | 134544019 |
13 | 8a1460b5 |
14 | 532086d7 |
15 | 33541a63 |
hex | 20d3db15 |
550755093 has 8 divisors (see below), whose sum is σ = 839245888. Its totient is φ = 314717184.
The previous prime is 550755089. The next prime is 550755097. The reversal of 550755093 is 390557055.
It is a happy number.
550755093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (550755089) and next prime (550755097).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550755093 - 22 = 550755089 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550755097) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13113196 + ... + 13113237.
It is an arithmetic number, because the mean of its divisors is an integer number (104905736).
Almost surely, 2550755093 is an apocalyptic number.
It is an amenable number.
550755093 is a deficient number, since it is larger than the sum of its proper divisors (288490795).
550755093 is a wasteful number, since it uses less digits than its factorization.
550755093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26226443.
The product of its (nonzero) digits is 118125, while the sum is 39.
The square root of 550755093 is about 23468.1719143183. The cubic root of 550755093 is about 819.6960468743.
The spelling of 550755093 in words is "five hundred fifty million, seven hundred fifty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •