Base | Representation |
---|---|
bin | 1001100100101… |
… | …1011010110100 |
3 | 2210120002000222 |
4 | 2121023122310 |
5 | 40234423204 |
6 | 3552353512 |
7 | 665211254 |
oct | 231133264 |
9 | 83502028 |
10 | 40154804 |
11 | 20736998 |
12 | 11545898 |
13 | 841c151 |
14 | 5493964 |
15 | 37d2abe |
hex | 264b6b4 |
40154804 has 12 divisors (see below), whose sum is σ = 70385028. Its totient is φ = 20044800.
The previous prime is 40154801. The next prime is 40154813. The reversal of 40154804 is 40845104.
40154804 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 38464804 + 1690000 = 6202^2 + 1300^2 .
It is a super-2 number, since 2×401548042 = 3224816568556832, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40154801) 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 3 ways as a sum of consecutive naturals, for example, 5267 + ... + 10394.
It is an arithmetic number, because the mean of its divisors is an integer number (5865419).
Almost surely, 240154804 is an apocalyptic number.
It is an amenable number.
40154804 is a deficient number, since it is larger than the sum of its proper divisors (30230224).
40154804 is a wasteful number, since it uses less digits than its factorization.
40154804 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16306 (or 16304 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 26.
The square root of 40154804 is about 6336.7818330758. The cubic root of 40154804 is about 342.4358066064.
Adding to 40154804 its reverse (40845104), we get a palindrome (80999908).
The spelling of 40154804 in words is "forty million, one hundred fifty-four thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •