Base | Representation |
---|---|
bin | 1100111000011… |
… | …1001001010011 |
3 | 10202200001111121 |
4 | 3032013021103 |
5 | 102312442211 |
6 | 5210023111 |
7 | 1224153403 |
oct | 316071123 |
9 | 122601447 |
10 | 54030931 |
11 | 28554269 |
12 | 16117a97 |
13 | b26a086 |
14 | 7266803 |
15 | 4b24271 |
hex | 3387253 |
54030931 has 2 divisors, whose sum is σ = 54030932. Its totient is φ = 54030930.
The previous prime is 54030883. The next prime is 54030943. The reversal of 54030931 is 13903045.
54030931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 54030931 - 29 = 54030419 is a prime.
It is a super-3 number, since 3×540309313 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 54030896 and 54030905.
It is not a weakly prime, because it can be changed into another prime (54030331) 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 as a sum of consecutive naturals, namely, 27015465 + 27015466.
It is an arithmetic number, because the mean of its divisors is an integer number (27015466).
Almost surely, 254030931 is an apocalyptic number.
54030931 is a deficient number, since it is larger than the sum of its proper divisors (1).
54030931 is an equidigital number, since it uses as much as digits as its factorization.
54030931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 54030931 is about 7350.5735150395. The cubic root of 54030931 is about 378.0484690048.
Adding to 54030931 its reverse (13903045), we get a palindrome (67933976).
The spelling of 54030931 in words is "fifty-four million, thirty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •