Base | Representation |
---|---|
bin | 11001100000110000011100… |
… | …11100001111100010011101 |
3 | 21100122012202110210022102120 |
4 | 30300120032130033202131 |
5 | 24323130030401330203 |
6 | 315152254125413153 |
7 | 14550112453225401 |
oct | 1460301634174235 |
9 | 240565673708376 |
10 | 56101105105053 |
11 | 1696a3883083a8 |
12 | 636092a70a1b9 |
13 | 253c40850ca08 |
14 | dbd445125101 |
15 | 6744b9d75b53 |
hex | 33060e70f89d |
56101105105053 has 4 divisors (see below), whose sum is σ = 74801473473408. Its totient is φ = 37400736736700.
The previous prime is 56101105105051. The next prime is 56101105105109. The reversal of 56101105105053 is 35050150110165.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 56101105105053 - 21 = 56101105105051 is a prime.
It is a super-2 number, since 2×561011051050532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56101105105051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9350184184173 + ... + 9350184184178.
It is an arithmetic number, because the mean of its divisors is an integer number (18700368368352).
Almost surely, 256101105105053 is an apocalyptic number.
It is an amenable number.
56101105105053 is a deficient number, since it is larger than the sum of its proper divisors (18700368368355).
56101105105053 is a wasteful number, since it uses less digits than its factorization.
56101105105053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18700368368354.
The product of its (nonzero) digits is 11250, while the sum is 33.
The spelling of 56101105105053 in words is "fifty-six trillion, one hundred one billion, one hundred five million, one hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •