Base | Representation |
---|---|
bin | 11000010010100011100011… |
… | …11110001010011010100101 |
3 | 21000010100012020110021220020 |
4 | 30021101301332022122211 |
5 | 24000114112101222203 |
6 | 305334035505425353 |
7 | 14152020551545335 |
oct | 1411216176123245 |
9 | 230110166407806 |
10 | 53414125414053 |
11 | 16023892324878 |
12 | 5ba802263b259 |
13 | 23a5c13171381 |
14 | d293866a50c5 |
15 | 629655e05153 |
hex | 309471f8a6a5 |
53414125414053 has 8 divisors (see below), whose sum is σ = 71430165738048. Its totient is φ = 35503751016384.
The previous prime is 53414125413977. The next prime is 53414125414061. The reversal of 53414125414053 is 35041452141435.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53414125414053 - 220 = 53414124365477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53414125413996 and 53414125414014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53414125414063) 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, 26416480401 + ... + 26416482422.
It is an arithmetic number, because the mean of its divisors is an integer number (8928770717256).
Almost surely, 253414125414053 is an apocalyptic number.
It is an amenable number.
53414125414053 is a deficient number, since it is larger than the sum of its proper divisors (18016040323995).
53414125414053 is a wasteful number, since it uses less digits than its factorization.
53414125414053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52832963163.
The product of its (nonzero) digits is 576000, while the sum is 42.
Adding to 53414125414053 its reverse (35041452141435), we get a palindrome (88455577555488).
The spelling of 53414125414053 in words is "fifty-three trillion, four hundred fourteen billion, one hundred twenty-five million, four hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •