Base | Representation |
---|---|
bin | 1000100110110001… |
… | …01100000000111101 |
3 | 102220222201210022222 |
4 | 10103120230000331 |
5 | 33430233044031 |
6 | 2042243015125 |
7 | 222331050515 |
oct | 42330540075 |
9 | 12828653288 |
10 | 4620206141 |
11 | 1a60a93291 |
12 | a8b36a4a5 |
13 | 5882734b5 |
14 | 31b87a845 |
15 | 1c0934e7b |
hex | 11362c03d |
4620206141 has 2 divisors, whose sum is σ = 4620206142. Its totient is φ = 4620206140.
The previous prime is 4620206113. The next prime is 4620206147. The reversal of 4620206141 is 1416020264.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3776594116 + 843612025 = 61454^2 + 29045^2 .
It is a cyclic number.
It is not a de Polignac number, because 4620206141 - 214 = 4620189757 is a prime.
It is a super-2 number, since 2×46202061412 = 42692609570668223762, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4620206141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4620206147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2310103070 + 2310103071.
It is an arithmetic number, because the mean of its divisors is an integer number (2310103071).
Almost surely, 24620206141 is an apocalyptic number.
It is an amenable number.
4620206141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4620206141 is an equidigital number, since it uses as much as digits as its factorization.
4620206141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 4620206141 is about 67972.0982536217. The cubic root of 4620206141 is about 1665.5350799118.
The spelling of 4620206141 in words is "four billion, six hundred twenty million, two hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •