Base | Representation |
---|---|
bin | 11110110000000000010… |
… | …01110011110111011100 |
3 | 10202000011210120002122002 |
4 | 33120000021303313130 |
5 | 114302321004322211 |
6 | 2125213512341432 |
7 | 136222440203120 |
oct | 17300011636734 |
9 | 3660153502562 |
10 | 1056564526556 |
11 | 3780a5148a00 |
12 | 1509293a4878 |
13 | 7883105c7b6 |
14 | 391d0937580 |
15 | 1c73c5a603b |
hex | f600273ddc |
1056564526556 has 72 divisors (see below), whose sum is σ = 2323545678048. Its totient is φ = 411497856000.
The previous prime is 1056564526547. The next prime is 1056564526571. The reversal of 1056564526556 is 6556254656501.
1056564526556 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10565645265562 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9434120 + ... + 9545456.
Almost surely, 21056564526556 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1056564526556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1161772839024).
1056564526556 is an abundant number, since it is smaller than the sum of its proper divisors (1266981151492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056564526556 is a wasteful number, since it uses less digits than its factorization.
1056564526556 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114171 (or 114158 counting only the distinct ones).
The product of its (nonzero) digits is 32400000, while the sum is 56.
The spelling of 1056564526556 in words is "one trillion, fifty-six billion, five hundred sixty-four million, five hundred twenty-six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •