Base | Representation |
---|---|
bin | 10010010110000011… |
… | …000101101001010101 |
3 | 1212211201212112121102 |
4 | 102112003011221111 |
5 | 310314444324031 |
6 | 13014312355445 |
7 | 1265054646215 |
oct | 222603055125 |
9 | 55751775542 |
10 | 19697261141 |
11 | 8398654918 |
12 | 39986a5b85 |
13 | 1b1ba5b30c |
14 | d4bddc245 |
15 | 7a43ba7cb |
hex | 4960c5a55 |
19697261141 has 2 divisors, whose sum is σ = 19697261142. Its totient is φ = 19697261140.
The previous prime is 19697261083. The next prime is 19697261147. The reversal of 19697261141 is 14116279691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13864120516 + 5833140625 = 117746^2 + 76375^2 .
It is a cyclic number.
It is not a de Polignac number, because 19697261141 - 226 = 19630152277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19697261147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9848630570 + 9848630571.
It is an arithmetic number, because the mean of its divisors is an integer number (9848630571).
Almost surely, 219697261141 is an apocalyptic number.
It is an amenable number.
19697261141 is a deficient number, since it is larger than the sum of its proper divisors (1).
19697261141 is an equidigital number, since it uses as much as digits as its factorization.
19697261141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 163296, while the sum is 47.
The spelling of 19697261141 in words is "nineteen billion, six hundred ninety-seven million, two hundred sixty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •