Base | Representation |
---|---|
bin | 11000000110110… |
… | …100010001000011 |
3 | 1001012000200120010 |
4 | 120012310101003 |
5 | 1312014041011 |
6 | 104044320003 |
7 | 13010453514 |
oct | 3006642103 |
9 | 1035020503 |
10 | 404440131 |
11 | 198328947 |
12 | b3543003 |
13 | 65a375b4 |
14 | 3b9dca0b |
15 | 2578e1a6 |
hex | 181b4443 |
404440131 has 4 divisors (see below), whose sum is σ = 539253512. Its totient is φ = 269626752.
The previous prime is 404440117. The next prime is 404440139. The reversal of 404440131 is 131044404.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 404440131 - 26 = 404440067 is a prime.
It is a super-2 number, since 2×4044401312 = 327143639126594322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 404440098 and 404440107.
It is not an unprimeable number, because it can be changed into a prime (404440139) 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 3 ways as a sum of consecutive naturals, for example, 67406686 + ... + 67406691.
It is an arithmetic number, because the mean of its divisors is an integer number (134813378).
Almost surely, 2404440131 is an apocalyptic number.
404440131 is a deficient number, since it is larger than the sum of its proper divisors (134813381).
404440131 is a wasteful number, since it uses less digits than its factorization.
404440131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134813380.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 404440131 is about 20110.6969297436. The cubic root of 404440131 is about 739.5225377496.
Adding to 404440131 its reverse (131044404), we get a palindrome (535484535).
The spelling of 404440131 in words is "four hundred four million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •