Base | Representation |
---|---|
bin | 11000001101111101100010… |
… | …10101101010010010010000 |
3 | 20222120020202100120122120001 |
4 | 30012332301111222102100 |
5 | 23440022322313423220 |
6 | 305133332254055344 |
7 | 14134432064202442 |
oct | 1406766125522220 |
9 | 228506670518501 |
10 | 53256274748560 |
11 | 15a7294a786524 |
12 | 5b8150a7aa554 |
13 | 23940782a6b20 |
14 | d21890400492 |
15 | 6254b7ec780a |
hex | 306fb156a490 |
53256274748560 has 40 divisors (see below), whose sum is σ = 133345518699960. Its totient is φ = 19663855291392.
The previous prime is 53256274748533. The next prime is 53256274748641. The reversal of 53256274748560 is 6584747265235.
It can be written as a sum of positive squares in 4 ways, for example, as 96835481856 + 53159439266704 = 311184^2 + 7291052^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 53256274748492 and 53256274748501.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25603977205 + ... + 25603979284.
It is an arithmetic number, because the mean of its divisors is an integer number (3333637967499).
Almost surely, 253256274748560 is an apocalyptic number.
It is an amenable number.
53256274748560 is an abundant number, since it is smaller than the sum of its proper divisors (80089243951400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53256274748560 is a wasteful number, since it uses less digits than its factorization.
53256274748560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51207956515 (or 51207956509 counting only the distinct ones).
The product of its (nonzero) digits is 338688000, while the sum is 64.
The spelling of 53256274748560 in words is "fifty-three trillion, two hundred fifty-six billion, two hundred seventy-four million, seven hundred forty-eight thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •