Base | Representation |
---|---|
bin | 11000010110111011110001… |
… | …00110010001010000010001 |
3 | 21000122201111022111202001221 |
4 | 30023131320212101100101 |
5 | 24010100204433241411 |
6 | 305531115214325041 |
7 | 14165624512326610 |
oct | 1413357046212021 |
9 | 230581438452057 |
10 | 53564560446481 |
11 | 16081669a46257 |
12 | 6011206ab9781 |
13 | 23b71688a9866 |
14 | d32777b39877 |
15 | 62d50ccb8071 |
hex | 30b778991411 |
53564560446481 has 4 divisors (see below), whose sum is σ = 61216640510272. Its totient is φ = 45912480382692.
The previous prime is 53564560446457. The next prime is 53564560446653. The reversal of 53564560446481 is 18464406546535.
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 de Polignac number, because none of the positive numbers 2k-53564560446481 is a prime.
It is a super-2 number, since 2×535645604464812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53564560246481) 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, 3826040031885 + ... + 3826040031898.
It is an arithmetic number, because the mean of its divisors is an integer number (15304160127568).
Almost surely, 253564560446481 is an apocalyptic number.
It is an amenable number.
53564560446481 is a deficient number, since it is larger than the sum of its proper divisors (7652080063791).
53564560446481 is an equidigital number, since it uses as much as digits as its factorization.
53564560446481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7652080063790.
The product of its (nonzero) digits is 165888000, while the sum is 61.
The spelling of 53564560446481 in words is "fifty-three trillion, five hundred sixty-four billion, five hundred sixty million, four hundred forty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •