Base | Representation |
---|---|
bin | 1100010110001111110… |
… | …0001000010011110001 |
3 | 202021112201012211202022 |
4 | 3011203330020103301 |
5 | 11433420301321221 |
6 | 241241244201225 |
7 | 21216532065224 |
oct | 3054374102361 |
9 | 667481184668 |
10 | 212130104561 |
11 | 81a66a06301 |
12 | 35141b39215 |
13 | 17008407c3b |
14 | a3a50c95bb |
15 | 57b83444ab |
hex | 3163f084f1 |
212130104561 has 2 divisors, whose sum is σ = 212130104562. Its totient is φ = 212130104560.
The previous prime is 212130104471. The next prime is 212130104567. The reversal of 212130104561 is 165401031212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128993032336 + 83137072225 = 359156^2 + 288335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212130104561 is a prime.
It is a super-2 number, since 2×2121301045612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212130104561.
It is not a weakly prime, because it can be changed into another prime (212130104567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106065052280 + 106065052281.
It is an arithmetic number, because the mean of its divisors is an integer number (106065052281).
Almost surely, 2212130104561 is an apocalyptic number.
It is an amenable number.
212130104561 is a deficient number, since it is larger than the sum of its proper divisors (1).
212130104561 is an equidigital number, since it uses as much as digits as its factorization.
212130104561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 212130104561 its reverse (165401031212), we get a palindrome (377531135773).
The spelling of 212130104561 in words is "two hundred twelve billion, one hundred thirty million, one hundred four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •