Base | Representation |
---|---|
bin | 1100111000100… |
… | …1110101000011 |
3 | 10202200121120201 |
4 | 3032021311003 |
5 | 102313320143 |
6 | 5210150031 |
7 | 1224230425 |
oct | 316116503 |
9 | 122617521 |
10 | 54041923 |
11 | 28561551 |
12 | 16122317 |
13 | b272090 |
14 | 726a815 |
15 | 4b2764d |
hex | 3389d43 |
54041923 has 8 divisors (see below), whose sum is σ = 58278528. Its totient is φ = 49816704.
The previous prime is 54041921. The next prime is 54041951. The reversal of 54041923 is 32914045.
54041923 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 a cyclic number.
It is not a de Polignac number, because 54041923 - 21 = 54041921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54041891 and 54041900.
It is not an unprimeable number, because it can be changed into a prime (54041921) 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, 8811 + ... + 13627.
It is an arithmetic number, because the mean of its divisors is an integer number (7284816).
Almost surely, 254041923 is an apocalyptic number.
54041923 is a deficient number, since it is larger than the sum of its proper divisors (4236605).
54041923 is a wasteful number, since it uses less digits than its factorization.
54041923 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5693.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 54041923 is about 7351.3211737755. The cubic root of 54041923 is about 378.0741038707.
Adding to 54041923 its reverse (32914045), we get a palindrome (86955968).
The spelling of 54041923 in words is "fifty-four million, forty-one thousand, nine hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •