Base | Representation |
---|---|
bin | 11000000110000… |
… | …001101110110101 |
3 | 1001011122011121211 |
4 | 120012001232311 |
5 | 1311440430031 |
6 | 104040041421 |
7 | 13005632164 |
oct | 3006015665 |
9 | 1034564554 |
10 | 404233141 |
11 | 1981a7384 |
12 | b3463271 |
13 | 65994310 |
14 | 3b9873db |
15 | 2574cbb1 |
hex | 18181bb5 |
404233141 has 4 divisors (see below), whose sum is σ = 435328012. Its totient is φ = 373138272.
The previous prime is 404233133. The next prime is 404233163. The reversal of 404233141 is 141332404.
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 233172900 + 171060241 = 15270^2 + 13079^2 .
It is not a de Polignac number, because 404233141 - 23 = 404233133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404233111) 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, 15547416 + ... + 15547441.
It is an arithmetic number, because the mean of its divisors is an integer number (108832003).
Almost surely, 2404233141 is an apocalyptic number.
It is an amenable number.
404233141 is a deficient number, since it is larger than the sum of its proper divisors (31094871).
404233141 is a wasteful number, since it uses less digits than its factorization.
404233141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31094870.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 404233141 is about 20105.5500049116. The cubic root of 404233141 is about 739.3963551745.
Adding to 404233141 its reverse (141332404), we get a palindrome (545565545).
The spelling of 404233141 in words is "four hundred four million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •