Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …11110000000011010111 |
3 | 1221120200020212021121011 |
4 | 20000033033300003113 |
5 | 33002410432213421 |
6 | 1100401041233051 |
7 | 54510541320520 |
oct | 10001717600327 |
9 | 1846606767534 |
10 | 550011601111 |
11 | 1a2293234645 |
12 | 8a719932787 |
13 | 3cb3442005b |
14 | 1c8992d3847 |
15 | e49151a4e1 |
hex | 800f3f00d7 |
550011601111 has 8 divisors (see below), whose sum is σ = 632096334720. Its totient is φ = 468804779448.
The previous prime is 550011601039. The next prime is 550011601123. The reversal of 550011601111 is 111106110055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 550011601111 - 211 = 550011599063 is a prime.
It is a super-2 number, since 2×5500116011112 (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 (550011604111) 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, 219476641 + ... + 219479146.
It is an arithmetic number, because the mean of its divisors is an integer number (79012041840).
Almost surely, 2550011601111 is an apocalyptic number.
550011601111 is a deficient number, since it is larger than the sum of its proper divisors (82084733609).
550011601111 is a wasteful number, since it uses less digits than its factorization.
550011601111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438955973.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 550011601111 its reverse (111106110055), we get a palindrome (661117711166).
The spelling of 550011601111 in words is "five hundred fifty billion, eleven million, six hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •