Base | Representation |
---|---|
bin | 11110101111001010111… |
… | …01010100101000001111 |
3 | 10201222000120210221121222 |
4 | 33113211131110220033 |
5 | 114300411331003110 |
6 | 2125101233113555 |
7 | 136205361315014 |
oct | 17274535245017 |
9 | 3658016727558 |
10 | 1056116656655 |
11 | 377995357695 |
12 | 1508233b88bb |
13 | 7878c32a518 |
14 | 3918b27170b |
15 | 1c7130d8c55 |
hex | f5e5754a0f |
1056116656655 has 48 divisors (see below), whose sum is σ = 1353486274560. Its totient is φ = 790942376448.
The previous prime is 1056116656633. The next prime is 1056116656687. The reversal of 1056116656655 is 5566566116501.
It is not a de Polignac number, because 1056116656655 - 212 = 1056116652559 is a prime.
It is a super-2 number, since 2×10561166566552 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056116656597 and 1056116656606.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 492820514 + ... + 492822656.
It is an arithmetic number, because the mean of its divisors is an integer number (28197630720).
Almost surely, 21056116656655 is an apocalyptic number.
1056116656655 is a deficient number, since it is larger than the sum of its proper divisors (297369617905).
1056116656655 is a wasteful number, since it uses less digits than its factorization.
1056116656655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3848 (or 3831 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 53.
The spelling of 1056116656655 in words is "one trillion, fifty-six billion, one hundred sixteen million, six hundred fifty-six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •