Base | Representation |
---|---|
bin | 1001101100001111000001… |
… | …0111001110111001100000 |
3 | 1101201122211201001201120122 |
4 | 2123003300113032321200 |
5 | 2344040032142010011 |
6 | 34355032013055412 |
7 | 2146560333320543 |
oct | 233036027167140 |
9 | 41648751051518 |
10 | 10655551516256 |
11 | 3438aa304aa29 |
12 | 124114a787568 |
13 | 5c3a77a359ba |
14 | 28ba3512a85a |
15 | 137296bee3db |
hex | 9b0f05cee60 |
10655551516256 has 48 divisors (see below), whose sum is σ = 21425526743040. Its totient is φ = 5214159189120.
The previous prime is 10655551516243. The next prime is 10655551516331. The reversal of 10655551516256 is 65261515555601.
It is a super-2 number, since 2×106555515162562 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10655551516198 and 10655551516207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31988321 + ... + 32319711.
It is an arithmetic number, because the mean of its divisors is an integer number (446365140480).
Almost surely, 210655551516256 is an apocalyptic number.
10655551516256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10655551516256 is an abundant number, since it is smaller than the sum of its proper divisors (10769975226784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10655551516256 is a wasteful number, since it uses less digits than its factorization.
10655551516256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352827 (or 352819 counting only the distinct ones).
The product of its (nonzero) digits is 6750000, while the sum is 53.
The spelling of 10655551516256 in words is "ten trillion, six hundred fifty-five billion, five hundred fifty-one million, five hundred sixteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •