Base | Representation |
---|---|
bin | 100111101101110… |
… | …0001011101010001 |
3 | 10102212112212002212 |
4 | 1033123201131101 |
5 | 10212122134433 |
6 | 340122321505 |
7 | 45011016623 |
oct | 11733413521 |
9 | 3385485085 |
10 | 1332614993 |
11 | 624254406 |
12 | 312359295 |
13 | 1831172a8 |
14 | c8db0c13 |
15 | 7bed3d48 |
hex | 4f6e1751 |
1332614993 has 2 divisors, whose sum is σ = 1332614994. Its totient is φ = 1332614992.
The previous prime is 1332614981. The next prime is 1332615001. The reversal of 1332614993 is 3994162331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1312830289 + 19784704 = 36233^2 + 4448^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332614993 - 216 = 1332549457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1332614993.
It is not a weakly prime, because it can be changed into another prime (1332614953) 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, 666307496 + 666307497.
It is an arithmetic number, because the mean of its divisors is an integer number (666307497).
Almost surely, 21332614993 is an apocalyptic number.
It is an amenable number.
1332614993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332614993 is an equidigital number, since it uses as much as digits as its factorization.
1332614993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 104976, while the sum is 41.
The square root of 1332614993 is about 36504.9995617039. Note that the first 3 decimals coincide. The cubic root of 1332614993 is about 1100.4447218309. Note that the first 3 decimals are identical.
The spelling of 1332614993 in words is "one billion, three hundred thirty-two million, six hundred fourteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •