Base | Representation |
---|---|
bin | 10111111100000001111100… |
… | …10011010000110010011001 |
3 | 20220101100110120021221100202 |
4 | 23332000332103100302121 |
5 | 23344424024042313130 |
6 | 303542320243311545 |
7 | 14042061226610660 |
oct | 1376007623206231 |
9 | 226340416257322 |
10 | 52640164416665 |
11 | 1585562853a151 |
12 | 5aa202467b5b5 |
13 | 234ac3ba72c67 |
14 | cddb246a7dd7 |
15 | 614458b1d145 |
hex | 2fe03e4d0c99 |
52640164416665 has 64 divisors (see below), whose sum is σ = 74271226765824. Its totient is φ = 35066164267008.
The previous prime is 52640164416611. The next prime is 52640164416701. The reversal of 52640164416665 is 56661446104625.
52640164416665 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 52640164416665 - 226 = 52640097307801 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52640164416665.
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 63 ways as a sum of consecutive naturals, for example, 232091597 + ... + 232318293.
It is an arithmetic number, because the mean of its divisors is an integer number (1160487918216).
Almost surely, 252640164416665 is an apocalyptic number.
It is an amenable number.
52640164416665 is a deficient number, since it is larger than the sum of its proper divisors (21631062349159).
52640164416665 is a wasteful number, since it uses less digits than its factorization.
52640164416665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227586.
The product of its (nonzero) digits is 24883200, while the sum is 56.
The spelling of 52640164416665 in words is "fifty-two trillion, six hundred forty billion, one hundred sixty-four million, four hundred sixteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •