Base | Representation |
---|---|
bin | 100100011111000… |
… | …111100000010101 |
3 | 1120122211210002001 |
4 | 210133013200111 |
5 | 2223201340411 |
6 | 140424115301 |
7 | 21112035631 |
oct | 4437074025 |
9 | 1518753061 |
10 | 612136981 |
11 | 294598635 |
12 | 151005b31 |
13 | 99a88041 |
14 | 5b425dc1 |
15 | 38b18dc1 |
hex | 247c7815 |
612136981 has 2 divisors, whose sum is σ = 612136982. Its totient is φ = 612136980.
The previous prime is 612136963. The next prime is 612136999. The reversal of 612136981 is 189631216.
It is a balanced prime because it is at equal distance from previous prime (612136963) and next prime (612136999).
It can be written as a sum of positive squares in only one way, i.e., 587286756 + 24850225 = 24234^2 + 4985^2 .
It is a cyclic number.
It is not a de Polignac number, because 612136981 - 27 = 612136853 is a prime.
It is a super-2 number, since 2×6121369812 = 749423367015588722, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 612136981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (612136781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306068490 + 306068491.
It is an arithmetic number, because the mean of its divisors is an integer number (306068491).
Almost surely, 2612136981 is an apocalyptic number.
It is an amenable number.
612136981 is a deficient number, since it is larger than the sum of its proper divisors (1).
612136981 is an equidigital number, since it uses as much as digits as its factorization.
612136981 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15552, while the sum is 37.
The square root of 612136981 is about 24741.4021631758. The cubic root of 612136981 is about 849.0818140518.
The spelling of 612136981 in words is "six hundred twelve million, one hundred thirty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •