Base | Representation |
---|---|
bin | 1100111100101… |
… | …1001100001001 |
3 | 10210012012211012 |
4 | 3033023030021 |
5 | 102400402031 |
6 | 5220013305 |
7 | 1226424101 |
oct | 317131411 |
9 | 123165735 |
10 | 54309641 |
11 | 28724701 |
12 | 16231235 |
13 | b336ba9 |
14 | 72da201 |
15 | 4b7bb2b |
hex | 33cb309 |
54309641 has 2 divisors, whose sum is σ = 54309642. Its totient is φ = 54309640.
The previous prime is 54309637. The next prime is 54309653. The reversal of 54309641 is 14690345.
54309641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49561600 + 4748041 = 7040^2 + 2179^2 .
It is a cyclic number.
It is not a de Polignac number, because 54309641 - 22 = 54309637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54309598 and 54309607.
It is not a weakly prime, because it can be changed into another prime (54309631) 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, 27154820 + 27154821.
It is an arithmetic number, because the mean of its divisors is an integer number (27154821).
Almost surely, 254309641 is an apocalyptic number.
It is an amenable number.
54309641 is a deficient number, since it is larger than the sum of its proper divisors (1).
54309641 is an equidigital number, since it uses as much as digits as its factorization.
54309641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 54309641 is about 7369.5075140745. The cubic root of 54309641 is about 378.6973888807.
Adding to 54309641 its reverse (14690345), we get a palindrome (68999986).
The spelling of 54309641 in words is "fifty-four million, three hundred nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.041 sec. • engine limits •