Base | Representation |
---|---|
bin | 11001100101010111001110… |
… | …10110100010010110001001 |
3 | 21101012100020202002210221020 |
4 | 30302223213112202112021 |
5 | 24333223133422302003 |
6 | 315353110011303053 |
7 | 14564414315000100 |
oct | 1462534726422611 |
9 | 241170222083836 |
10 | 56259363087753 |
11 | 16a2050986a141 |
12 | 6387536a4aa89 |
13 | 25513098ab267 |
14 | dc6d79537037 |
15 | 67867d90ed53 |
hex | 332ae75a2589 |
56259363087753 has 24 divisors (see below), whose sum is σ = 87327752164992. Its totient is φ = 32123032581024.
The previous prime is 56259363087679. The next prime is 56259363087769. The reversal of 56259363087753 is 35778036395265.
56259363087753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56259363087753 - 29 = 56259363087241 is a prime.
It is not an unprimeable number, because it can be changed into a prime (56259363087553) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 149662225 + ... + 150037662.
It is an arithmetic number, because the mean of its divisors is an integer number (3638656340208).
Almost surely, 256259363087753 is an apocalyptic number.
It is an amenable number.
56259363087753 is a deficient number, since it is larger than the sum of its proper divisors (31068389077239).
56259363087753 is a wasteful number, since it uses less digits than its factorization.
56259363087753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299701181 (or 299701174 counting only the distinct ones).
The product of its (nonzero) digits is 857304000, while the sum is 69.
The spelling of 56259363087753 in words is "fifty-six trillion, two hundred fifty-nine billion, three hundred sixty-three million, eighty-seven thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •