Base | Representation |
---|---|
bin | 11000010011011001110010… |
… | …00010100010110111110110 |
3 | 21000020010022221100010111020 |
4 | 30021230321002202313312 |
5 | 24001103221132020231 |
6 | 305355252213522010 |
7 | 14154101120325651 |
oct | 1411547102426766 |
9 | 230203287303436 |
10 | 53443235032566 |
11 | 1603516aa06035 |
12 | 5bb17a7343306 |
13 | 23a88a1c29b02 |
14 | d2a948778898 |
15 | 62a2ab7a2396 |
hex | 309b390a2df6 |
53443235032566 has 24 divisors (see below), whose sum is σ = 113543758861800. Its totient is φ = 16766505107712.
The previous prime is 53443235032553. The next prime is 53443235032609. The reversal of 53443235032566 is 66523053234435.
53443235032566 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 15410388991 + ... + 15410392458.
It is an arithmetic number, because the mean of its divisors is an integer number (4730989952575).
Almost surely, 253443235032566 is an apocalyptic number.
53443235032566 is an abundant number, since it is smaller than the sum of its proper divisors (60100523829234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53443235032566 is a wasteful number, since it uses less digits than its factorization.
53443235032566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30820781488 (or 30820781471 counting only the distinct ones).
The product of its (nonzero) digits is 23328000, while the sum is 51.
The spelling of 53443235032566 in words is "fifty-three trillion, four hundred forty-three billion, two hundred thirty-five million, thirty-two thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •