Base | Representation |
---|---|
bin | 1100010010110100100… |
… | …1110100000000011101 |
3 | 202012011122122200020121 |
4 | 3010231021310000131 |
5 | 11430030000211131 |
6 | 241010131314541 |
7 | 21155001256342 |
oct | 3045511640035 |
9 | 665148580217 |
10 | 211210944541 |
11 | 81635087823 |
12 | 34b2614ba51 |
13 | 16bbcb6357c |
14 | a318dc27c9 |
15 | 57627d0911 |
hex | 312d27401d |
211210944541 has 2 divisors, whose sum is σ = 211210944542. Its totient is φ = 211210944540.
The previous prime is 211210944523. The next prime is 211210944547. The reversal of 211210944541 is 145449012112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195677061316 + 15533883225 = 442354^2 + 124635^2 .
It is a cyclic number.
It is not a de Polignac number, because 211210944541 - 211 = 211210942493 is a prime.
It is a super-2 number, since 2×2112109445412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211210944497 and 211210944506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211210944547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105605472270 + 105605472271.
It is an arithmetic number, because the mean of its divisors is an integer number (105605472271).
Almost surely, 2211210944541 is an apocalyptic number.
It is an amenable number.
211210944541 is a deficient number, since it is larger than the sum of its proper divisors (1).
211210944541 is an equidigital number, since it uses as much as digits as its factorization.
211210944541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 34.
Adding to 211210944541 its reverse (145449012112), we get a palindrome (356659956653).
The spelling of 211210944541 in words is "two hundred eleven billion, two hundred ten million, nine hundred forty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •