Base | Representation |
---|---|
bin | 100000110100011… |
… | …111011001110111 |
3 | 1102101002221202220 |
4 | 200310133121313 |
5 | 2111430143111 |
6 | 130345533423 |
7 | 16434200166 |
oct | 4064373167 |
9 | 1371087686 |
10 | 550631031 |
11 | 2628a9275 |
12 | 1344a4273 |
13 | 8a1017a2 |
14 | 531b53dd |
15 | 33519e06 |
hex | 20d1f677 |
550631031 has 8 divisors (see below), whose sum is σ = 735648000. Its totient is φ = 366350712.
The previous prime is 550630987. The next prime is 550631041. The reversal of 550631031 is 130136055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550631031 - 27 = 550630903 is a prime.
It is a super-2 number, since 2×5506310312 = 606389064600245922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 550630992 and 550631010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550631041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182415 + ... + 185408.
It is an arithmetic number, because the mean of its divisors is an integer number (91956000).
Almost surely, 2550631031 is an apocalyptic number.
550631031 is a deficient number, since it is larger than the sum of its proper divisors (185016969).
550631031 is a wasteful number, since it uses less digits than its factorization.
550631031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368325.
The product of its (nonzero) digits is 1350, while the sum is 24.
The square root of 550631031 is about 23465.5285685194. The cubic root of 550631031 is about 819.6344945504.
Adding to 550631031 its reverse (130136055), we get a palindrome (680767086).
The spelling of 550631031 in words is "five hundred fifty million, six hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •