Base | Representation |
---|---|
bin | 1100111101010… |
… | …1010011001110 |
3 | 10210021022122000 |
4 | 3033111103032 |
5 | 102403213204 |
6 | 5220533130 |
7 | 1226655612 |
oct | 317252316 |
9 | 123238560 |
10 | 54351054 |
11 | 2875282a |
12 | 162511a6 |
13 | b34c9b4 |
14 | 730b342 |
15 | 4b89039 |
hex | 33d54ce |
54351054 has 64 divisors (see below), whose sum is σ = 125452800. Its totient is φ = 17430336.
The previous prime is 54351049. The next prime is 54351067. The reversal of 54351054 is 45015345.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 206527 + ... + 206789.
It is an arithmetic number, because the mean of its divisors is an integer number (1960200).
Almost surely, 254351054 is an apocalyptic number.
54351054 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 54351054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62726400).
54351054 is an abundant number, since it is smaller than the sum of its proper divisors (71101746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54351054 is a wasteful number, since it uses less digits than its factorization.
54351054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 400 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 54351054 is about 7372.3167322084. The cubic root of 54351054 is about 378.7936210910.
Adding to 54351054 its reverse (45015345), we get a palindrome (99366399).
The spelling of 54351054 in words is "fifty-four million, three hundred fifty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •