Base | Representation |
---|---|
bin | 11000000101100… |
… | …111111110001111 |
3 | 1001011102210220001 |
4 | 120011213332033 |
5 | 1311424041011 |
6 | 104033505131 |
7 | 13005012445 |
oct | 3005477617 |
9 | 1034383801 |
10 | 404127631 |
11 | 198135086 |
12 | b34121a7 |
13 | 6595829b |
14 | 3b95ab95 |
15 | 2572b7c1 |
hex | 18167f8f |
404127631 has 4 divisors (see below), whose sum is σ = 413525992. Its totient is φ = 394729272.
The previous prime is 404127629. The next prime is 404127649. The reversal of 404127631 is 136721404.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 404127631 - 21 = 404127629 is a prime.
It is a super-2 number, since 2×4041276312 = 326638284275344322, 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 404127631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404127601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4699116 + ... + 4699201.
It is an arithmetic number, because the mean of its divisors is an integer number (103381498).
Almost surely, 2404127631 is an apocalyptic number.
404127631 is a deficient number, since it is larger than the sum of its proper divisors (9398361).
404127631 is an equidigital number, since it uses as much as digits as its factorization.
404127631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9398360.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 404127631 is about 20102.9259313166. The cubic root of 404127631 is about 739.3320189536.
The spelling of 404127631 in words is "four hundred four million, one hundred twenty-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •