Base | Representation |
---|---|
bin | 111110100010010000000000… |
… | …0010001011101110110111111 |
3 | 2200010121201001112021211011100 |
4 | 1331010200000101131312333 |
5 | 1034044231213331041223 |
6 | 5225520222005224143 |
7 | 223601613605413152 |
oct | 17504400021356677 |
9 | 2603551045254140 |
10 | 550065056112063 |
11 | 14a2a430a010828 |
12 | 5183a362402053 |
13 | 1a7c0bb21bab1b |
14 | 99b940dc23c99 |
15 | 438d6c3aed043 |
hex | 1f4480045ddbf |
550065056112063 has 12 divisors (see below), whose sum is σ = 799870886965800. Its totient is φ = 364248896216496.
The previous prime is 550065056112049. The next prime is 550065056112067. The reversal of 550065056112063 is 360211650560055.
550065056112063 is a `hidden beast` number, since 5 + 5 + 0 + 0 + 6 + 5 + 0 + 5 + 611 + 20 + 6 + 3 = 666.
It is not a de Polignac number, because 550065056112063 - 28 = 550065056111807 is a prime.
It is a super-2 number, since 2×5500650561120632 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550065056112067) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 205095097881 + ... + 205095100562.
It is an arithmetic number, because the mean of its divisors is an integer number (66655907247150).
Almost surely, 2550065056112063 is an apocalyptic number.
550065056112063 is a deficient number, since it is larger than the sum of its proper divisors (249805830853737).
550065056112063 is a wasteful number, since it uses less digits than its factorization.
550065056112063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410190198598 (or 410190198595 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 45.
The spelling of 550065056112063 in words is "five hundred fifty trillion, sixty-five billion, fifty-six million, one hundred twelve thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.976 sec. • engine limits •