Base | Representation |
---|---|
bin | 110010011010101… |
… | …0010010010011101 |
3 | 11100220012202121102 |
4 | 1210311102102131 |
5 | 11431033041031 |
6 | 435510442445 |
7 | 56631062141 |
oct | 14465222235 |
9 | 4326182542 |
10 | 1691690141 |
11 | 798a07929 |
12 | 3b2663425 |
13 | 20c62a0ab |
14 | 120961221 |
15 | 9d7b17cb |
hex | 64d5249d |
1691690141 has 2 divisors, whose sum is σ = 1691690142. Its totient is φ = 1691690140.
The previous prime is 1691690113. The next prime is 1691690149. The reversal of 1691690141 is 1410961961.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1455422500 + 236267641 = 38150^2 + 15371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1691690141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1691690095 and 1691690104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1691690149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 845845070 + 845845071.
It is an arithmetic number, because the mean of its divisors is an integer number (845845071).
Almost surely, 21691690141 is an apocalyptic number.
It is an amenable number.
1691690141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1691690141 is an equidigital number, since it uses as much as digits as its factorization.
1691690141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The square root of 1691690141 is about 41130.1609649172. The cubic root of 1691690141 is about 1191.5353721672.
The spelling of 1691690141 in words is "one billion, six hundred ninety-one million, six hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •