Base | Representation |
---|---|
bin | 1011110001000100011… |
… | …11000100000100100001 |
3 | 1102122120110020001100021 |
4 | 11320202033010010201 |
5 | 23111002113100001 |
6 | 505422231553441 |
7 | 41131651230154 |
oct | 5704217040441 |
9 | 1378513201307 |
10 | 404301300001 |
11 | 1465105a8795 |
12 | 6643382b881 |
13 | 2c1827c4481 |
14 | 157d5547c9b |
15 | a7b4337ba1 |
hex | 5e223c4121 |
404301300001 has 4 divisors (see below), whose sum is σ = 404306246212. Its totient is φ = 404296353792.
The previous prime is 404301299971. The next prime is 404301300023. The reversal of 404301300001 is 100003103404.
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 184363749376 + 219937550625 = 429376^2 + 468975^2 .
It is a cyclic number.
It is not a de Polignac number, because 404301300001 - 219 = 404300775713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (404301300071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2348400 + ... + 2514673.
It is an arithmetic number, because the mean of its divisors is an integer number (101076561553).
Almost surely, 2404301300001 is an apocalyptic number.
It is an amenable number.
404301300001 is a deficient number, since it is larger than the sum of its proper divisors (4946211).
404301300001 is an equidigital number, since it uses as much as digits as its factorization.
404301300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4946210.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 404301300001 its reverse (100003103404), we get a palindrome (504304403405).
It can be divided in two parts, 40430 and 1300001, that added together give a palindrome (1340431).
The spelling of 404301300001 in words is "four hundred four billion, three hundred one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •