Base | Representation |
---|---|
bin | 10100100111010101101101 |
3 | 101011112220122 |
4 | 110213111231 |
5 | 2340412023 |
6 | 311454325 |
7 | 63635066 |
oct | 24472555 |
9 | 11145818 |
10 | 5404013 |
11 | 306112a |
12 | 19873a5 |
13 | 1172954 |
14 | a0956d |
15 | 71b2c8 |
hex | 52756d |
5404013 has 8 divisors (see below), whose sum is σ = 5698560. Its totient is φ = 5117040.
The previous prime is 5403997. The next prime is 5404031. The reversal of 5404013 is 3104045.
5404013 = T142 + T143 + ... + T327.
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 5404013 - 24 = 5403997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5403982 and 5404000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5404033) 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, 398 + ... + 3311.
It is an arithmetic number, because the mean of its divisors is an integer number (712320).
Almost surely, 25404013 is an apocalyptic number.
It is an amenable number.
5404013 is a deficient number, since it is larger than the sum of its proper divisors (294547).
5404013 is a wasteful number, since it uses less digits than its factorization.
5404013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787.
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 5404013 is about 2324.6533074848. The cubic root of 5404013 is about 175.4845130989.
Adding to 5404013 its reverse (3104045), we get a palindrome (8508058).
Subtracting from 5404013 its reverse (3104045), we obtain a cube (2299968 = 1323).
The spelling of 5404013 in words is "five million, four hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •