Base | Representation |
---|---|
bin | 10000000000110110100… |
… | …01001111111000010011 |
3 | 1221121012022102200011221 |
4 | 20000123101033320103 |
5 | 33003314102221321 |
6 | 1100433044545511 |
7 | 54515541025042 |
oct | 10003321177023 |
9 | 1847168380157 |
10 | 550213320211 |
11 | 1a2387091145 |
12 | 8a7753b2297 |
13 | 3cb67159979 |
14 | 1c8b8002559 |
15 | e4a40b3e41 |
hex | 801b44fe13 |
550213320211 has 8 divisors (see below), whose sum is σ = 572297730048. Its totient is φ = 528399885000.
The previous prime is 550213320179. The next prime is 550213320229. The reversal of 550213320211 is 112023312055.
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 550213320211 - 25 = 550213320179 is a prime.
It is a super-2 number, since 2×5502133202112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550213320271) 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, 67739515 + ... + 67747636.
It is an arithmetic number, because the mean of its divisors is an integer number (71537216256).
Almost surely, 2550213320211 is an apocalyptic number.
550213320211 is a deficient number, since it is larger than the sum of its proper divisors (22084409837).
550213320211 is a wasteful number, since it uses less digits than its factorization.
550213320211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135487313.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 550213320211 its reverse (112023312055), we get a palindrome (662236632266).
The spelling of 550213320211 in words is "five hundred fifty billion, two hundred thirteen million, three hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •