Base | Representation |
---|---|
bin | 11110101000111… |
… | …100110000111101 |
3 | 1022211021111120212 |
4 | 132220330300331 |
5 | 2023044114013 |
6 | 123001522205 |
7 | 15511235231 |
oct | 3650746075 |
9 | 1284244525 |
10 | 514051133 |
11 | 244194252 |
12 | 1241a3365 |
13 | 8266488b |
14 | 4c3b25c1 |
15 | 301e16a8 |
hex | 1ea3cc3d |
514051133 has 2 divisors, whose sum is σ = 514051134. Its totient is φ = 514051132.
The previous prime is 514051073. The next prime is 514051157. The reversal of 514051133 is 331150415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 336282244 + 177768889 = 18338^2 + 13333^2 .
It is a cyclic number.
It is not a de Polignac number, because 514051133 - 28 = 514050877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 514051099 and 514051108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (514051163) 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, 257025566 + 257025567.
It is an arithmetic number, because the mean of its divisors is an integer number (257025567).
Almost surely, 2514051133 is an apocalyptic number.
It is an amenable number.
514051133 is a deficient number, since it is larger than the sum of its proper divisors (1).
514051133 is an equidigital number, since it uses as much as digits as its factorization.
514051133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 514051133 is about 22672.6957594372. The cubic root of 514051133 is about 801.0668750271.
The spelling of 514051133 in words is "five hundred fourteen million, fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •