Base | Representation |
---|---|
bin | 111110100110011101011010… |
… | …0110110011111001111101011 |
3 | 2200012200000102001000020221210 |
4 | 1331030322310312133033223 |
5 | 1034133221104000133421 |
6 | 5231042103255404203 |
7 | 223661455003562205 |
oct | 17514726466371753 |
9 | 2605600361006853 |
10 | 550643611333611 |
11 | 14a4a770a391924 |
12 | 51912507383663 |
13 | 1a8336150443c3 |
14 | 99d9415d75775 |
15 | 439d785e62576 |
hex | 1f4ceb4d9f3eb |
550643611333611 has 48 divisors (see below), whose sum is σ = 820738435939200. Its totient is φ = 327201422558976.
The previous prime is 550643611333561. The next prime is 550643611333657. The reversal of 550643611333611 is 116333116346055.
It is not a de Polignac number, because 550643611333611 - 213 = 550643611325419 is a prime.
It is not an unprimeable number, because it can be changed into a prime (550643611333661) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 46595820 + ... + 57205398.
It is an arithmetic number, because the mean of its divisors is an integer number (17098717415400).
Almost surely, 2550643611333611 is an apocalyptic number.
550643611333611 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
550643611333611 is a deficient number, since it is larger than the sum of its proper divisors (270094824605589).
550643611333611 is a wasteful number, since it uses less digits than its factorization.
550643611333611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10612456 (or 10612437 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 48.
Adding to 550643611333611 its reverse (116333116346055), we get a palindrome (666976727679666).
The spelling of 550643611333611 in words is "five hundred fifty trillion, six hundred forty-three billion, six hundred eleven million, three hundred thirty-three thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •