Base | Representation |
---|---|
bin | 10000100000110111010010… |
… | …101011011010101001010001 |
3 | 100112011002100000122000210012 |
4 | 100200313102223122221101 |
5 | 34004410333432323003 |
6 | 414244240154244305 |
7 | 21204065102231633 |
oct | 2040672253325121 |
9 | 315132300560705 |
10 | 72627136604753 |
11 | 21160aa5256285 |
12 | 818b761126695 |
13 | 316a92bc97c43 |
14 | 13d125a5daa53 |
15 | 85e2e9dab8d8 |
hex | 420dd2adaa51 |
72627136604753 has 4 divisors (see below), whose sum is σ = 75784838196288. Its totient is φ = 69469435013220.
The previous prime is 72627136604653. The next prime is 72627136604767. The reversal of 72627136604753 is 35740663172627.
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 72627136604753 - 28 = 72627136604497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 72627136604692 and 72627136604701.
It is not an unprimeable number, because it can be changed into a prime (72627136604153) 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, 1578850795733 + ... + 1578850795778.
It is an arithmetic number, because the mean of its divisors is an integer number (18946209549072).
Almost surely, 272627136604753 is an apocalyptic number.
It is an amenable number.
72627136604753 is a deficient number, since it is larger than the sum of its proper divisors (3157701591535).
72627136604753 is a wasteful number, since it uses less digits than its factorization.
72627136604753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3157701591534.
The product of its (nonzero) digits is 53343360, while the sum is 59.
The spelling of 72627136604753 in words is "seventy-two trillion, six hundred twenty-seven billion, one hundred thirty-six million, six hundred four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •