Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …00001001000000000011 |
3 | 1221120202222001120200101 |
4 | 20000101210021000003 |
5 | 33003000412004421 |
6 | 1100404551103231 |
7 | 54511523053243 |
oct | 10002144110003 |
9 | 1846688046611 |
10 | 550050500611 |
11 | 1a2303193397 |
12 | 8a72a971b17 |
13 | 3cb3c4bca01 |
14 | 1c8a053bb23 |
15 | e494b51191 |
hex | 8011909003 |
550050500611 has 8 divisors (see below), whose sum is σ = 573995554560. Its totient is φ = 526107931272.
The previous prime is 550050500591. The next prime is 550050500663. The reversal of 550050500611 is 116005050055.
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 550050500611 - 211 = 550050498563 is a prime.
It is a super-3 number, since 3×5500505006113 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 550050500611.
It is not an unprimeable number, because it can be changed into a prime (550030500611) 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, 161505 + ... + 1061218.
It is an arithmetic number, because the mean of its divisors is an integer number (71749444320).
Almost surely, 2550050500611 is an apocalyptic number.
550050500611 is a deficient number, since it is larger than the sum of its proper divisors (23945053949).
550050500611 is a wasteful number, since it uses less digits than its factorization.
550050500611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242305.
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 550050500611 its reverse (116005050055), we get a palindrome (666055550666).
The spelling of 550050500611 in words is "five hundred fifty billion, fifty million, five hundred thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •