Base | Representation |
---|---|
bin | 10000000000110110110… |
… | …00001001110000001001 |
3 | 1221121012102211121220122 |
4 | 20000123120021300021 |
5 | 33003320033130441 |
6 | 1100433151433025 |
7 | 54515562303536 |
oct | 10003330116011 |
9 | 1847172747818 |
10 | 550215130121 |
11 | 1a2388107a38 |
12 | 8a775b25775 |
13 | 3cb67641717 |
14 | 1c8b8353d8d |
15 | e4a432034b |
hex | 801b609c09 |
550215130121 has 8 divisors (see below), whose sum is σ = 583401370080. Its totient is φ = 517451645088.
The previous prime is 550215130117. The next prime is 550215130123. The reversal of 550215130121 is 121031512055.
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 550215130121 - 22 = 550215130117 is a prime.
It is a super-2 number, since 2×5502151301212 (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 (550215130123) 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, 105686051 + ... + 105691256.
It is an arithmetic number, because the mean of its divisors is an integer number (72925171260).
Almost surely, 2550215130121 is an apocalyptic number.
It is an amenable number.
550215130121 is a deficient number, since it is larger than the sum of its proper divisors (33186239959).
550215130121 is a wasteful number, since it uses less digits than its factorization.
550215130121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211377463.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 550215130121 its reverse (121031512055), we get a palindrome (671246642176).
The spelling of 550215130121 in words is "five hundred fifty billion, two hundred fifteen million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •