Base | Representation |
---|---|
bin | 1011110000100010111… |
… | …11111011110100110001 |
3 | 1102121211212212102212122 |
4 | 11320101133323310301 |
5 | 23104413222310001 |
6 | 505334321404025 |
7 | 41122001446343 |
oct | 5702137736461 |
9 | 1377755772778 |
10 | 404020510001 |
11 | 146387055039 |
12 | 66375799615 |
13 | 2c139591344 |
14 | 157aa135293 |
15 | a799870b1b |
hex | 5e117fbd31 |
404020510001 has 16 divisors (see below), whose sum is σ = 430043060304. Its totient is φ = 378249467904.
The previous prime is 404020509979. The next prime is 404020510007. The reversal of 404020510001 is 100015020404.
It can be written as a sum of positive squares in 8 ways, for example, as 58042446400 + 345978063601 = 240920^2 + 588199^2 .
It is a cyclic number.
It is not a de Polignac number, because 404020510001 - 218 = 404020247857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (404020510007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24281981 + ... + 24298613.
It is an arithmetic number, because the mean of its divisors is an integer number (26877691269).
Almost surely, 2404020510001 is an apocalyptic number.
It is an amenable number.
404020510001 is a deficient number, since it is larger than the sum of its proper divisors (26022550303).
404020510001 is a wasteful number, since it uses less digits than its factorization.
404020510001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24100.
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 404020510001 its reverse (100015020404), we get a palindrome (504035530405).
The spelling of 404020510001 in words is "four hundred four billion, twenty million, five hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •