Base | Representation |
---|---|
bin | 1100111000110… |
… | …0010111100001 |
3 | 10202201010211211 |
4 | 3032030113201 |
5 | 102314133241 |
6 | 5210310121 |
7 | 1224302641 |
oct | 316142741 |
9 | 122633754 |
10 | 54052321 |
11 | 28569344 |
12 | 16128341 |
13 | b276a2b |
14 | 7270521 |
15 | 4b2a781 |
hex | 338c5e1 |
54052321 has 8 divisors (see below), whose sum is σ = 56998080. Its totient is φ = 51116688.
The previous prime is 54052291. The next prime is 54052331. The reversal of 54052321 is 12325045.
54052321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 54052321 - 25 = 54052289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54052292 and 54052301.
It is not an unprimeable number, because it can be changed into a prime (54052331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10095 + ... + 14491.
It is an arithmetic number, because the mean of its divisors is an integer number (7124760).
Almost surely, 254052321 is an apocalyptic number.
It is an amenable number.
54052321 is a deficient number, since it is larger than the sum of its proper divisors (2945759).
54052321 is a wasteful number, since it uses less digits than its factorization.
54052321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5063.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 54052321 is about 7352.0283595753. The cubic root of 54052321 is about 378.0983502471.
Adding to 54052321 its reverse (12325045), we get a palindrome (66377366).
The spelling of 54052321 in words is "fifty-four million, fifty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •