Base | Representation |
---|---|
bin | 11001110010111011101110… |
… | …01111100101100000011101 |
3 | 21102211220202221102200202212 |
4 | 30321131313033211200131 |
5 | 24413343044203342030 |
6 | 320351221335530205 |
7 | 14643202040260340 |
oct | 1471356717454035 |
9 | 242756687380685 |
10 | 56725633652765 |
11 | 1709022a3a9930 |
12 | 6441983b29965 |
13 | 2586286b0557c |
14 | 100176ccac457 |
15 | 68586d2db595 |
hex | 3397773e581d |
56725633652765 has 64 divisors (see below), whose sum is σ = 89357720279040. Its totient is φ = 33491466627840.
The previous prime is 56725633652761. The next prime is 56725633652839.
It is a happy number.
56725633652765 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56725633652765 - 22 = 56725633652761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56725633652695 and 56725633652704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56725633652761) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26753894 + ... + 28796216.
It is an arithmetic number, because the mean of its divisors is an integer number (1396214379360).
Almost surely, 256725633652765 is an apocalyptic number.
56725633652765 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56725633652765 is a deficient number, since it is larger than the sum of its proper divisors (32632086626275).
56725633652765 is a wasteful number, since it uses less digits than its factorization.
56725633652765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2046162.
The product of its digits is 1428840000, while the sum is 68.
The spelling of 56725633652765 in words is "fifty-six trillion, seven hundred twenty-five billion, six hundred thirty-three million, six hundred fifty-two thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •