Base | Representation |
---|---|
bin | 101001001101110… |
… | …010111000010101 |
3 | 1210012010221011101 |
4 | 221031302320111 |
5 | 2404004412013 |
6 | 152340510101 |
7 | 23064333616 |
oct | 5115627025 |
9 | 1705127141 |
10 | 691482133 |
11 | 325361841 |
12 | 1736ab331 |
13 | b0349334 |
14 | 67b9bc0d |
15 | 40a8d8dd |
hex | 29372e15 |
691482133 has 2 divisors, whose sum is σ = 691482134. Its totient is φ = 691482132.
The previous prime is 691482109. The next prime is 691482139. The reversal of 691482133 is 331284196.
691482133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 463411729 + 228070404 = 21527^2 + 15102^2 .
It is a cyclic number.
It is not a de Polignac number, because 691482133 - 29 = 691481621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 691482092 and 691482101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (691482139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345741066 + 345741067.
It is an arithmetic number, because the mean of its divisors is an integer number (345741067).
Almost surely, 2691482133 is an apocalyptic number.
It is an amenable number.
691482133 is a deficient number, since it is larger than the sum of its proper divisors (1).
691482133 is an equidigital number, since it uses as much as digits as its factorization.
691482133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 37.
The square root of 691482133 is about 26296.0478589464. The cubic root of 691482133 is about 884.2878427145.
The spelling of 691482133 in words is "six hundred ninety-one million, four hundred eighty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •