Base | Representation |
---|---|
bin | 1011101011101110001… |
… | …01111100100011110001 |
3 | 1102101011100101012110001 |
4 | 11311313011330203301 |
5 | 23034112040143001 |
6 | 504225302110001 |
7 | 41000544515503 |
oct | 5656705744361 |
9 | 1371140335401 |
10 | 401430006001 |
11 | 145277856042 |
12 | 6597211b301 |
13 | 2bb1599473b |
14 | 15602085d73 |
15 | a697219001 |
hex | 5d7717c8f1 |
401430006001 has 2 divisors, whose sum is σ = 401430006002. Its totient is φ = 401430006000.
The previous prime is 401430005987. The next prime is 401430006049. The reversal of 401430006001 is 100600034104.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 401418547776 + 11458225 = 633576^2 + 3385^2 .
It is a cyclic number.
It is not a de Polignac number, because 401430006001 - 225 = 401396451569 is a prime.
It is a super-2 number, since 2×4014300060012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 401430006001.
It is not a weakly prime, because it can be changed into another prime (401430006071) 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 as a sum of consecutive naturals, namely, 200715003000 + 200715003001.
It is an arithmetic number, because the mean of its divisors is an integer number (200715003001).
Almost surely, 2401430006001 is an apocalyptic number.
It is an amenable number.
401430006001 is a deficient number, since it is larger than the sum of its proper divisors (1).
401430006001 is an equidigital number, since it uses as much as digits as its factorization.
401430006001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The spelling of 401430006001 in words is "four hundred one billion, four hundred thirty million, six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •