Base | Representation |
---|---|
bin | 1100000101101011… |
… | …1001110010011101 |
3 | 22101011010212210011 |
4 | 3001122321302131 |
5 | 23121213231013 |
6 | 1254000443221 |
7 | 143262341065 |
oct | 30132716235 |
9 | 8334125704 |
10 | 3245055133 |
11 | 1415826a51 |
12 | 766919511 |
13 | 3c93b5288 |
14 | 22ad963a5 |
15 | 13ed4cc3d |
hex | c16b9c9d |
3245055133 has 2 divisors, whose sum is σ = 3245055134. Its totient is φ = 3245055132.
The previous prime is 3245055131. The next prime is 3245055181. The reversal of 3245055133 is 3315505423.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2902731129 + 342324004 = 53877^2 + 18502^2 .
It is a cyclic number.
It is not a de Polignac number, because 3245055133 - 21 = 3245055131 is a prime.
Together with 3245055131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3245055095 and 3245055104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3245055131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1622527566 + 1622527567.
It is an arithmetic number, because the mean of its divisors is an integer number (1622527567).
Almost surely, 23245055133 is an apocalyptic number.
It is an amenable number.
3245055133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3245055133 is an equidigital number, since it uses as much as digits as its factorization.
3245055133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 31.
The square root of 3245055133 is about 56965.3853932368. The cubic root of 3245055133 is about 1480.4964144662.
The spelling of 3245055133 in words is "three billion, two hundred forty-five million, fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •