Base | Representation |
---|---|
bin | 10000000000111100101… |
… | …00111000010111000111 |
3 | 1221121022212221011110100 |
4 | 20000132110320113013 |
5 | 33003420214312403 |
6 | 1100442120055143 |
7 | 54520032650544 |
oct | 10003624702707 |
9 | 1847285834410 |
10 | 550264604103 |
11 | 1a2403029525 |
12 | 8a78a6044b3 |
13 | 3cb74974576 |
14 | 1c8c0b51bcb |
15 | e4a88442a3 |
hex | 801e5385c7 |
550264604103 has 12 divisors (see below), whose sum is σ = 795270959080. Its totient is φ = 366638003856.
The previous prime is 550264604089. The next prime is 550264604117. The reversal of 550264604103 is 301406462055.
550264604103 is a `hidden beast` number, since 5 + 5 + 0 + 2 + 646 + 0 + 4 + 1 + 0 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (550264604089) and next prime (550264604117).
It is not a de Polignac number, because 550264604103 - 26 = 550264604039 is a prime.
It is a super-2 number, since 2×5502646041032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550264614103) 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 11 ways as a sum of consecutive naturals, for example, 17071801 + ... + 17104002.
Almost surely, 2550264604103 is an apocalyptic number.
550264604103 is a deficient number, since it is larger than the sum of its proper divisors (245006354977).
550264604103 is a wasteful number, since it uses less digits than its factorization.
550264604103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34177598 (or 34177595 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 550264604103 in words is "five hundred fifty billion, two hundred sixty-four million, six hundred four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •