Base | Representation |
---|---|
bin | 11000010100010111100011… |
… | …11001001001110100000101 |
3 | 21000100021221100012021110121 |
4 | 30022023301321021310011 |
5 | 24002124132142023121 |
6 | 305422415230221541 |
7 | 14156354033430562 |
oct | 1412136171116405 |
9 | 230307840167417 |
10 | 53476401126661 |
11 | 1604823a344457 |
12 | 5bb81026548b1 |
13 | 23aba5921b966 |
14 | d2c3b34a3869 |
15 | 62b09d32d141 |
hex | 30a2f1e49d05 |
53476401126661 has 8 divisors (see below), whose sum is σ = 56471948395200. Its totient is φ = 50498953842240.
The previous prime is 53476401126601. The next prime is 53476401126671. The reversal of 53476401126661 is 16662110467435.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53476401126661 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53476401126599 and 53476401126608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53476401126601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4524989956 + ... + 4525001773.
It is an arithmetic number, because the mean of its divisors is an integer number (7058993549400).
Almost surely, 253476401126661 is an apocalyptic number.
It is an amenable number.
53476401126661 is a deficient number, since it is larger than the sum of its proper divisors (2995547268539).
53476401126661 is a wasteful number, since it uses less digits than its factorization.
53476401126661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9049992059.
The product of its (nonzero) digits is 4354560, while the sum is 52.
The spelling of 53476401126661 in words is "fifty-three trillion, four hundred seventy-six billion, four hundred one million, one hundred twenty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •