Base | Representation |
---|---|
bin | 100011110101011… |
… | …101010010001101 |
3 | 1112220021221111111 |
4 | 203311131102031 |
5 | 2212402404031 |
6 | 135354052021 |
7 | 20620152511 |
oct | 4365352215 |
9 | 1486257444 |
10 | 601216141 |
11 | 289409649 |
12 | 14941a011 |
13 | 977332c6 |
14 | 59bc2141 |
15 | 37bad1b1 |
hex | 23d5d48d |
601216141 has 2 divisors, whose sum is σ = 601216142. Its totient is φ = 601216140.
The previous prime is 601216127. The next prime is 601216163. The reversal of 601216141 is 141612106.
It is an a-pointer prime, because the next prime (601216163) can be obtained adding 601216141 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 467813641 + 133402500 = 21629^2 + 11550^2 .
It is a cyclic number.
It is not a de Polignac number, because 601216141 - 219 = 600691853 is a prime.
It is a super-2 number, since 2×6012161412 = 722921696397863762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (601216111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 300608070 + 300608071.
It is an arithmetic number, because the mean of its divisors is an integer number (300608071).
Almost surely, 2601216141 is an apocalyptic number.
It is an amenable number.
601216141 is a deficient number, since it is larger than the sum of its proper divisors (1).
601216141 is an equidigital number, since it uses as much as digits as its factorization.
601216141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 601216141 is about 24519.7092356333. The cubic root of 601216141 is about 844.0021324153.
Adding to 601216141 its reverse (141612106), we get a palindrome (742828247).
The spelling of 601216141 in words is "six hundred one million, two hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •