Base | Representation |
---|---|
bin | 111001101101111… |
… | …1000111100100101 |
3 | 11222222020002120121 |
4 | 1303123320330211 |
5 | 12431243102411 |
6 | 520102001541 |
7 | 65664413251 |
oct | 16333707445 |
9 | 4888202517 |
10 | 1936690981 |
11 | 904236665 |
12 | 4607162b1 |
13 | 24b30c1c4 |
14 | 1452d9261 |
15 | b5059571 |
hex | 736f8f25 |
1936690981 has 2 divisors, whose sum is σ = 1936690982. Its totient is φ = 1936690980.
The previous prime is 1936690979. The next prime is 1936691023. The reversal of 1936690981 is 1890966391.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1775273956 + 161417025 = 42134^2 + 12705^2 .
It is a cyclic number.
It is not a de Polignac number, because 1936690981 - 21 = 1936690979 is a prime.
It is a super-2 number, since 2×19366909812 = 7501543911773484722, which contains 22 as substring.
Together with 1936690979, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1936690901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 968345490 + 968345491.
It is an arithmetic number, because the mean of its divisors is an integer number (968345491).
Almost surely, 21936690981 is an apocalyptic number.
It is an amenable number.
1936690981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1936690981 is an equidigital number, since it uses as much as digits as its factorization.
1936690981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 629856, while the sum is 52.
The square root of 1936690981 is about 44007.8513563205. The cubic root of 1936690981 is about 1246.4841965185.
The spelling of 1936690981 in words is "one billion, nine hundred thirty-six million, six hundred ninety thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •