Base | Representation |
---|---|
bin | 110001111010111001… |
… | …010100010110000001 |
3 | 12010100120120221222100 |
4 | 301322321110112001 |
5 | 1334233433002231 |
6 | 40342453101013 |
7 | 3605202560004 |
oct | 617271242601 |
9 | 163316527870 |
10 | 53601453441 |
11 | 20806694358 |
12 | a47b027769 |
13 | 5092c3b573 |
14 | 2846b7b53b |
15 | 15dab421e6 |
hex | c7ae54581 |
53601453441 has 24 divisors (see below), whose sum is σ = 82744874784. Its totient is φ = 33317953920.
The previous prime is 53601453439. The next prime is 53601453467. The reversal of 53601453441 is 14435410635.
53601453441 is a `hidden beast` number, since 5 + 3 + 601 + 4 + 5 + 3 + 4 + 41 = 666.
It is not a de Polignac number, because 53601453441 - 21 = 53601453439 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53601453396 and 53601453405.
It is not an unprimeable number, because it can be changed into a prime (53601453481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1620715 + ... + 1653456.
It is an arithmetic number, because the mean of its divisors is an integer number (3447703116).
Almost surely, 253601453441 is an apocalyptic number.
53601453441 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
53601453441 is a deficient number, since it is larger than the sum of its proper divisors (29143421343).
53601453441 is a wasteful number, since it uses less digits than its factorization.
53601453441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3274301 (or 3274298 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 53601453441 in words is "fifty-three billion, six hundred one million, four hundred fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •