Base | Representation |
---|---|
bin | 100011110100101… |
… | …101011001101011 |
3 | 1112212220222110102 |
4 | 203310231121223 |
5 | 2212330120021 |
6 | 135345540015 |
7 | 20615404634 |
oct | 4364553153 |
9 | 1485828412 |
10 | 601020011 |
11 | 289295259 |
12 | 14934460b |
13 | 97694c57 |
14 | 59b7088b |
15 | 37b7000b |
hex | 23d2d66b |
601020011 has 8 divisors (see below), whose sum is σ = 606824064. Its totient is φ = 595244160.
The previous prime is 601020001. The next prime is 601020031. The reversal of 601020011 is 110020106.
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 601020011 - 210 = 601018987 is a prime.
It is a super-2 number, since 2×6010200112 = 722450107244880242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 601019974 and 601020001.
It is not an unprimeable number, because it can be changed into a prime (601020001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37091 + ... + 50771.
It is an arithmetic number, because the mean of its divisors is an integer number (75853008).
Almost surely, 2601020011 is an apocalyptic number.
601020011 is a deficient number, since it is larger than the sum of its proper divisors (5804053).
601020011 is a wasteful number, since it uses less digits than its factorization.
601020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14101.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 601020011 is about 24515.7094737232. The cubic root of 601020011 is about 843.9103450471.
Adding to 601020011 its reverse (110020106), we get a palindrome (711040117).
The spelling of 601020011 in words is "six hundred one million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •