Base | Representation |
---|---|
bin | 10000000000110000010… |
… | …10000011110010001011 |
3 | 1221121001200011211000121 |
4 | 20000120022003302023 |
5 | 33003212220312021 |
6 | 1100423541444111 |
7 | 54514335140161 |
oct | 10003012036213 |
9 | 1847050154017 |
10 | 550161104011 |
11 | 1a235a667362 |
12 | 8a75ba10637 |
13 | 3cb593a68cc |
14 | 1c8b10cd231 |
15 | e49e6ec741 |
hex | 8018283c8b |
550161104011 has 8 divisors (see below), whose sum is σ = 586097288784. Its totient is φ = 514622004480.
The previous prime is 550161103993. The next prime is 550161104029. The reversal of 550161104011 is 110401161055.
It is an interprime number because it is at equal distance from previous prime (550161103993) and next prime (550161104029).
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 550161104011 - 219 = 550160579723 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550161104611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99268450 + ... + 99273991.
It is an arithmetic number, because the mean of its divisors is an integer number (73262161098).
Almost surely, 2550161104011 is an apocalyptic number.
550161104011 is a deficient number, since it is larger than the sum of its proper divisors (35936184773).
550161104011 is a wasteful number, since it uses less digits than its factorization.
550161104011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198542621.
The product of its (nonzero) digits is 600, while the sum is 25.
Adding to 550161104011 its reverse (110401161055), we get a palindrome (660562265066).
The spelling of 550161104011 in words is "five hundred fifty billion, one hundred sixty-one million, one hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •