Base | Representation |
---|---|
bin | 1001100010100… |
… | …1001001100001 |
3 | 2210021221111001 |
4 | 2120221021201 |
5 | 40220430213 |
6 | 3545352001 |
7 | 664055104 |
oct | 230511141 |
9 | 83257431 |
10 | 40014433 |
11 | 20650488 |
12 | 11498601 |
13 | 83a02a4 |
14 | 545873b |
15 | 37a61dd |
hex | 2629261 |
40014433 has 4 divisors (see below), whose sum is σ = 40269460. Its totient is φ = 39759408.
The previous prime is 40014421. The next prime is 40014479. The reversal of 40014433 is 33441004.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4397409 + 35617024 = 2097^2 + 5968^2 .
It is a cyclic number.
It is not a de Polignac number, because 40014433 - 221 = 37917281 is a prime.
It is a super-2 number, since 2×400144332 = 3202309696622978, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40014433.
It is not an unprimeable number, because it can be changed into a prime (40014833) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127278 + ... + 127591.
It is an arithmetic number, because the mean of its divisors is an integer number (10067365).
Almost surely, 240014433 is an apocalyptic number.
It is an amenable number.
40014433 is a deficient number, since it is larger than the sum of its proper divisors (255027).
40014433 is a wasteful number, since it uses less digits than its factorization.
40014433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255026.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 40014433 is about 6325.6962462641. The cubic root of 40014433 is about 342.0363178604.
Adding to 40014433 its reverse (33441004), we get a palindrome (73455437).
The spelling of 40014433 in words is "forty million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •