Base | Representation |
---|---|
bin | 100000110010100… |
… | …101110101110111 |
3 | 1102100011122202102 |
4 | 200302211311313 |
5 | 2111313224421 |
6 | 130331132315 |
7 | 16430024423 |
oct | 4062456567 |
9 | 1370148672 |
10 | 550133111 |
11 | 262599170 |
12 | 1342a409b |
13 | 89c88c68 |
14 | 530c5b83 |
15 | 3346c60b |
hex | 20ca5d77 |
550133111 has 8 divisors (see below), whose sum is σ = 600680448. Its totient is φ = 499675000.
The previous prime is 550133083. The next prime is 550133123. The reversal of 550133111 is 111331055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-550133111 is a prime.
It is a super-3 number, since 3×5501331113 (a number of 27 digits) contains 333 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 (550133191) 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, 9065 + ... + 34386.
It is an arithmetic number, because the mean of its divisors is an integer number (75085056).
Almost surely, 2550133111 is an apocalyptic number.
550133111 is a deficient number, since it is larger than the sum of its proper divisors (50547337).
550133111 is a wasteful number, since it uses less digits than its factorization.
550133111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44613.
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 550133111 is about 23454.9165634841. The cubic root of 550133111 is about 819.3873626470.
Adding to 550133111 its reverse (111331055), we get a palindrome (661464166).
It can be divided in two parts, 550 and 133111, that multiplied together give a triangular number (73211050 = T12100).
The spelling of 550133111 in words is "five hundred fifty million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •