Base | Representation |
---|---|
bin | 1101000000011… |
… | …0111100100001 |
3 | 10210122122120101 |
4 | 3100012330201 |
5 | 102431220101 |
6 | 5225142401 |
7 | 1231463506 |
oct | 320067441 |
9 | 123578511 |
10 | 54554401 |
11 | 28881590 |
12 | 1632aa01 |
13 | b3c1415 |
14 | 73614ad |
15 | 4bc9401 |
hex | 3406f21 |
54554401 has 8 divisors (see below), whose sum is σ = 60898464. Its totient is φ = 48441120.
The previous prime is 54554399. The next prime is 54554407. The reversal of 54554401 is 10445545.
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 54554401 - 21 = 54554399 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 54554401.
It is not an unprimeable number, because it can be changed into a prime (54554407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57196 + ... + 58141.
It is an arithmetic number, because the mean of its divisors is an integer number (7612308).
Almost surely, 254554401 is an apocalyptic number.
It is an amenable number.
54554401 is a deficient number, since it is larger than the sum of its proper divisors (6344063).
54554401 is a wasteful number, since it uses less digits than its factorization.
54554401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115391.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 54554401 is about 7386.0951117624. The cubic root of 54554401 is about 379.2654345982.
Adding to 54554401 its reverse (10445545), we get a palindrome (64999946).
It can be divided in two parts, 545 and 54401, that added together give a triangular number (54946 = T331).
The spelling of 54554401 in words is "fifty-four million, five hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •