Base | Representation |
---|---|
bin | 1011110000111101001… |
… | …01101110101110100111 |
3 | 1102122102012010110000221 |
4 | 11320132211232232213 |
5 | 23110340433224111 |
6 | 505412204545211 |
7 | 41130306302620 |
oct | 5703645565647 |
9 | 1378365113027 |
10 | 404240133031 |
11 | 14648a020079 |
12 | 66417252207 |
13 | 2c172c292b7 |
14 | 157cb384a47 |
15 | a7adca4371 |
hex | 5e1e96eba7 |
404240133031 has 8 divisors (see below), whose sum is σ = 461995991424. Its totient is φ = 346486091640.
The previous prime is 404240132983. The next prime is 404240133049. The reversal of 404240133031 is 130331042404.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 404240133031 - 27 = 404240132903 is a prime.
It is a super-2 number, since 2×4042401330312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 404240132987 and 404240133005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404240133131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61536 + ... + 901258.
It is an arithmetic number, because the mean of its divisors is an integer number (57749498928).
Almost surely, 2404240133031 is an apocalyptic number.
404240133031 is a deficient number, since it is larger than the sum of its proper divisors (57755858393).
404240133031 is an equidigital number, since it uses as much as digits as its factorization.
404240133031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 908501.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 404240133031 its reverse (130331042404), we get a palindrome (534571175435).
The spelling of 404240133031 in words is "four hundred four billion, two hundred forty million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •