Base | Representation |
---|---|
bin | 10011101010111110… |
… | …11100010000010000 |
3 | 1000021000121000210100 |
4 | 21311133130100100 |
5 | 133112121023211 |
6 | 4503545132400 |
7 | 522466651146 |
oct | 116537342020 |
9 | 30230530710 |
10 | 10561111056 |
11 | 452a521061 |
12 | 2068a8a100 |
13 | cc401b152 |
14 | 7228a5596 |
15 | 41c298156 |
hex | 2757dc410 |
10561111056 has 60 divisors (see below), whose sum is σ = 29849121900. Its totient is φ = 3485510400.
The previous prime is 10561111039. The next prime is 10561111087. The reversal of 10561111056 is 65011116501.
It can be written as a sum of positive squares in 2 ways, for example, as 9464176656 + 1096934400 = 97284^2 + 33120^2 .
It is a super-2 number, since 2×105611110562 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 348531 + ... + 377618.
It is an arithmetic number, because the mean of its divisors is an integer number (497485365).
Almost surely, 210561111056 is an apocalyptic number.
10561111056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10561111056 is an abundant number, since it is smaller than the sum of its proper divisors (19288010844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10561111056 is a wasteful number, since it uses less digits than its factorization.
10561111056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726264 (or 726255 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
Adding to 10561111056 its reverse (65011116501), we get a palindrome (75572227557).
Subtracting 10561111056 from its reverse (65011116501), we obtain a palindrome (54450005445).
The spelling of 10561111056 in words is "ten billion, five hundred sixty-one million, one hundred eleven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •