Base | Representation |
---|---|
bin | 110010111000010010… |
… | …110100001101011100 |
3 | 12020000100220011201001 |
4 | 302320102310031130 |
5 | 1343341134011430 |
6 | 41033011400044 |
7 | 3642551331250 |
oct | 627022641534 |
9 | 166010804631 |
10 | 54631547740 |
11 | 211950a2460 |
12 | a707bb3024 |
13 | 51c8484613 |
14 | 29038c0260 |
15 | 164b2ba3ca |
hex | cb84b435c |
54631547740 has 96 divisors (see below), whose sum is σ = 144348019200. Its totient is φ = 16871742720.
The previous prime is 54631547699. The next prime is 54631547759. The reversal of 54631547740 is 4774513645.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 5131 + ... + 330589.
It is an arithmetic number, because the mean of its divisors is an integer number (1503625200).
Almost surely, 254631547740 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54631547740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72174009600).
54631547740 is an abundant number, since it is smaller than the sum of its proper divisors (89716471460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54631547740 is a wasteful number, since it uses less digits than its factorization.
54631547740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325595 (or 325593 counting only the distinct ones).
The product of its (nonzero) digits is 1411200, while the sum is 46.
It can be divided in two parts, 5463 and 1547740, that added together give a triangular number (1553203 = T1762).
The spelling of 54631547740 in words is "fifty-four billion, six hundred thirty-one million, five hundred forty-seven thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •