Base | Representation |
---|---|
bin | 11000011100001111111001… |
… | …01000010101100101110001 |
3 | 21001022011211021200220220220 |
4 | 30032013330220111211301 |
5 | 24021043143014114343 |
6 | 310151034550523253 |
7 | 14215050555563622 |
oct | 1416077450254561 |
9 | 231264737626826 |
10 | 53747164207473 |
11 | 16142054011620 |
12 | 6040688666529 |
13 | 23cb449aacb89 |
14 | d3b53b675a49 |
15 | 633148d96183 |
hex | 30e1fca15971 |
53747164207473 has 32 divisors (see below), whose sum is σ = 78373107356544. Its totient is φ = 32492663040000.
The previous prime is 53747164207463. The next prime is 53747164207489. The reversal of 53747164207473 is 37470246174735.
53747164207473 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 53747164207473 - 29 = 53747164206961 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (53747164207463) 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 31 ways as a sum of consecutive naturals, for example, 45681843 + ... + 46843623.
It is an arithmetic number, because the mean of its divisors is an integer number (2449159604892).
Almost surely, 253747164207473 is an apocalyptic number.
It is an amenable number.
53747164207473 is a deficient number, since it is larger than the sum of its proper divisors (24625943149071).
53747164207473 is a wasteful number, since it uses less digits than its factorization.
53747164207473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165297.
The product of its (nonzero) digits is 82978560, while the sum is 60.
The spelling of 53747164207473 in words is "fifty-three trillion, seven hundred forty-seven billion, one hundred sixty-four million, two hundred seven thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •