Base | Representation |
---|---|
bin | 111110101101111… |
… | …000101010111001 |
3 | 2201022221002222201 |
4 | 332231320222321 |
5 | 4123331402433 |
6 | 252224350201 |
7 | 35034455053 |
oct | 7655705271 |
9 | 2638832881 |
10 | 1052215993 |
11 | 49aa484a4 |
12 | 254475361 |
13 | 139cc011a |
14 | 9da608d3 |
15 | 62597a7d |
hex | 3eb78ab9 |
1052215993 has 2 divisors, whose sum is σ = 1052215994. Its totient is φ = 1052215992.
The previous prime is 1052215987. The next prime is 1052215999. The reversal of 1052215993 is 3995122501.
It is a balanced prime because it is at equal distance from previous prime (1052215987) and next prime (1052215999).
It can be written as a sum of positive squares in only one way, i.e., 1049565609 + 2650384 = 32397^2 + 1628^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052215993 - 217 = 1052084921 is a prime.
It is a super-2 number, since 2×10522159932 = 2214316991849952098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1052215999) 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, 526107996 + 526107997.
It is an arithmetic number, because the mean of its divisors is an integer number (526107997).
Almost surely, 21052215993 is an apocalyptic number.
It is an amenable number.
1052215993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052215993 is an equidigital number, since it uses as much as digits as its factorization.
1052215993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 37.
The square root of 1052215993 is about 32437.8789842986. The cubic root of 1052215993 is about 1017.1108789030.
The spelling of 1052215993 in words is "one billion, fifty-two million, two hundred fifteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •