Base | Representation |
---|---|
bin | 1010110011011111… |
… | …0111001100001101 |
3 | 21111010110210010101 |
4 | 2230313313030031 |
5 | 21414440401013 |
6 | 1155444011101 |
7 | 131605233256 |
oct | 25467671415 |
9 | 7433423111 |
10 | 2900325133 |
11 | 1259181222 |
12 | 68b390a91 |
13 | 372b55a24 |
14 | 1d729bb2d |
15 | 11e9558dd |
hex | acdf730d |
2900325133 has 2 divisors, whose sum is σ = 2900325134. Its totient is φ = 2900325132.
The previous prime is 2900325107. The next prime is 2900325143. The reversal of 2900325133 is 3315230092.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2701712484 + 198612649 = 51978^2 + 14093^2 .
It is a cyclic number.
It is not a de Polignac number, because 2900325133 - 29 = 2900324621 is a prime.
It is a super-2 number, since 2×29003251332 = 16823771754222935378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2900325143) 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, 1450162566 + 1450162567.
It is an arithmetic number, because the mean of its divisors is an integer number (1450162567).
Almost surely, 22900325133 is an apocalyptic number.
It is an amenable number.
2900325133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2900325133 is an equidigital number, since it uses as much as digits as its factorization.
2900325133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 28.
The square root of 2900325133 is about 53854.6667708565. Note that the first 3 decimals coincide. The cubic root of 2900325133 is about 1426.0964386781.
The spelling of 2900325133 in words is "two billion, nine hundred million, three hundred twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •