Base | Representation |
---|---|
bin | 11000011010000011001010… |
… | …10001010011111011011000 |
3 | 21001000221210210211012011002 |
4 | 30031001211101103323120 |
5 | 24013323424223231304 |
6 | 310052221501524132 |
7 | 14206434352543400 |
oct | 1415014521237330 |
9 | 231027723735132 |
10 | 53671610367704 |
11 | 1611300292252a |
12 | 6029b01873648 |
13 | 23c4298b50804 |
14 | d37a111cd800 |
15 | 6311c5dcd31e |
hex | 30d065453ed8 |
53671610367704 has 48 divisors (see below), whose sum is σ = 120228255744480. Its totient is φ = 22380439838400.
The previous prime is 53671610367677. The next prime is 53671610367707. The reversal of 53671610367704 is 40776301617635.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a self number, because there is not a number n which added to its sum of digits gives 53671610367704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53671610367707) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1850220272 + ... + 1850249279.
It is an arithmetic number, because the mean of its divisors is an integer number (2504755328010).
Almost surely, 253671610367704 is an apocalyptic number.
It is an amenable number.
53671610367704 is an abundant number, since it is smaller than the sum of its proper divisors (66556645376776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53671610367704 is a wasteful number, since it uses less digits than its factorization.
53671610367704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700469608 (or 3700469597 counting only the distinct ones).
The product of its (nonzero) digits is 13335840, while the sum is 56.
The spelling of 53671610367704 in words is "fifty-three trillion, six hundred seventy-one billion, six hundred ten million, three hundred sixty-seven thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •