Base | Representation |
---|---|
bin | 1001100110101111001011… |
… | …1010110010100000001111 |
3 | 1101101122001120111020012012 |
4 | 2121223302322302200033 |
5 | 2341013120402023210 |
6 | 34243412114531435 |
7 | 2140005013162532 |
oct | 231536272624017 |
9 | 41348046436165 |
10 | 10561105111055 |
11 | 3401a375648a4 |
12 | 1226990896b7b |
13 | 5b7ba5983635 |
14 | 2872358b4a19 |
15 | 134aba31e305 |
hex | 99af2eb280f |
10561105111055 has 16 divisors (see below), whose sum is σ = 12943278092160. Its totient is φ = 8268924636672.
The previous prime is 10561105111043. The next prime is 10561105111061. The reversal of 10561105111055 is 55011150116501.
It is a cyclic number.
It is not a de Polignac number, because 10561105111055 - 26 = 10561105110991 is a prime.
It is a super-2 number, since 2×105611051110552 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 9833501 + ... + 10854489.
It is an arithmetic number, because the mean of its divisors is an integer number (808954880760).
Almost surely, 210561105111055 is an apocalyptic number.
10561105111055 is a deficient number, since it is larger than the sum of its proper divisors (2382172981105).
10561105111055 is a wasteful number, since it uses less digits than its factorization.
10561105111055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065058.
The product of its (nonzero) digits is 3750, while the sum is 32.
Adding to 10561105111055 its reverse (55011150116501), we get a palindrome (65572255227556).
The spelling of 10561105111055 in words is "ten trillion, five hundred sixty-one billion, one hundred five million, one hundred eleven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •