Base | Representation |
---|---|
bin | 111110101110010… |
… | …101111101111001 |
3 | 2201100011012121011 |
4 | 332232111331321 |
5 | 4123344222433 |
6 | 252231113521 |
7 | 35035464652 |
oct | 7656257571 |
9 | 2640135534 |
10 | 1052335993 |
11 | 4a001a675 |
12 | 2545128a1 |
13 | 13a032927 |
14 | 9da92529 |
15 | 625bd3cd |
hex | 3eb95f79 |
1052335993 has 2 divisors, whose sum is σ = 1052335994. Its totient is φ = 1052335992.
The previous prime is 1052335939. The next prime is 1052336003. The reversal of 1052335993 is 3995332501.
Together with previous prime (1052335939) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 897781369 + 154554624 = 29963^2 + 12432^2 .
It is an emirp because it is prime and its reverse (3995332501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1052335993 - 29 = 1052335481 is a prime.
It is a super-2 number, since 2×10523359932 = 2214822084326592098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1052336993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526167996 + 526167997.
It is an arithmetic number, because the mean of its divisors is an integer number (526167997).
Almost surely, 21052335993 is an apocalyptic number.
It is an amenable number.
1052335993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052335993 is an equidigital number, since it uses as much as digits as its factorization.
1052335993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 109350, while the sum is 40.
The square root of 1052335993 is about 32439.7286209364. The cubic root of 1052335993 is about 1017.1495429121.
The spelling of 1052335993 in words is "one billion, fifty-two million, three hundred thirty-five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •