Base | Representation |
---|---|
bin | 10000000000110111010… |
… | …11001101001110111001 |
3 | 1221121012210020101202100 |
4 | 20000123223031032321 |
5 | 33003322323000423 |
6 | 1100433450454013 |
7 | 54515652616311 |
oct | 10003353151671 |
9 | 1847183211670 |
10 | 550220125113 |
11 | 1a238aa0982a |
12 | 8a777734309 |
13 | 3cb686a0139 |
14 | 1c8b8c94441 |
15 | e4a49aa343 |
hex | 801bacd3b9 |
550220125113 has 6 divisors (see below), whose sum is σ = 794762402954. Its totient is φ = 366813416736.
The previous prime is 550220125093. The next prime is 550220125153. The reversal of 550220125113 is 311521022055.
550220125113 is a `hidden beast` number, since 5 + 502 + 20 + 1 + 25 + 113 = 666.
It can be written as a sum of positive squares in only one way, i.e., 433223290809 + 116996834304 = 658197^2 + 342048^2 .
It is not a de Polignac number, because 550220125113 - 228 = 549951689657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550220125153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 30567784720 + ... + 30567784737.
Almost surely, 2550220125113 is an apocalyptic number.
It is an amenable number.
550220125113 is a deficient number, since it is larger than the sum of its proper divisors (244542277841).
550220125113 is a wasteful number, since it uses less digits than its factorization.
550220125113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61135569463 (or 61135569460 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 550220125113 its reverse (311521022055), we get a palindrome (861741147168).
The spelling of 550220125113 in words is "five hundred fifty billion, two hundred twenty million, one hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •