Base | Representation |
---|---|
bin | 100100001000010… |
… | …000011110010001 |
3 | 1120020120022210122 |
4 | 210020100132101 |
5 | 2220133110101 |
6 | 140051440025 |
7 | 21010066562 |
oct | 4410203621 |
9 | 1506508718 |
10 | 606144401 |
11 | 291175295 |
12 | 14abb6015 |
13 | 9876a535 |
14 | 5a706169 |
15 | 3833351b |
hex | 24210791 |
606144401 has 4 divisors (see below), whose sum is σ = 641799972. Its totient is φ = 570488832.
The previous prime is 606144353. The next prime is 606144437. The reversal of 606144401 is 104441606.
It is a Cunningham number, because it is equal to 246202+1.
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 471932176 + 134212225 = 21724^2 + 11585^2 .
It is a cyclic number.
It is not a de Polignac number, because 606144401 - 26 = 606144337 is a prime.
It is a super-2 number, since 2×6061444012 = 734822069727297602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (606144481) 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, 17827760 + ... + 17827793.
It is an arithmetic number, because the mean of its divisors is an integer number (160449993).
Almost surely, 2606144401 is an apocalyptic number.
It is an amenable number.
606144401 is a deficient number, since it is larger than the sum of its proper divisors (35655571).
606144401 is a wasteful number, since it uses less digits than its factorization.
606144401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35655570.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 606144401 is about 24620.0000203087. Note that the first 4 decimals coincide. The cubic root of 606144401 is about 846.3019975802.
The spelling of 606144401 in words is "six hundred six million, one hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •