Base | Representation |
---|---|
bin | 100000110010000… |
… | …111110101011011 |
3 | 1102022221102011021 |
4 | 200302013311123 |
5 | 2111300311303 |
6 | 130324343311 |
7 | 16426003201 |
oct | 4062076533 |
9 | 1368842137 |
10 | 550010203 |
11 | 262514896 |
12 | 134244b37 |
13 | 89c45032 |
14 | 53093071 |
15 | 33445ebd |
hex | 20c87d5b |
550010203 has 16 divisors (see below), whose sum is σ = 578866176. Its totient is φ = 522063360.
The previous prime is 550010191. The next prime is 550010243. The reversal of 550010203 is 302010055.
550010203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550010203 is a prime.
It is a super-2 number, since 2×5500102032 = 605022446808202418, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550010243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 274975 + ... + 276967.
It is an arithmetic number, because the mean of its divisors is an integer number (36179136).
Almost surely, 2550010203 is an apocalyptic number.
550010203 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
550010203 is a deficient number, since it is larger than the sum of its proper divisors (28855973).
550010203 is a wasteful number, since it uses less digits than its factorization.
550010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2214.
The product of its (nonzero) digits is 150, while the sum is 16.
The square root of 550010203 is about 23452.2963267992. The cubic root of 550010203 is about 819.3263369541.
Adding to 550010203 its reverse (302010055), we get a palindrome (852020258).
The spelling of 550010203 in words is "five hundred fifty million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •