Base | Representation |
---|---|
bin | 111110101110101… |
… | …101101111101111 |
3 | 2201100100011012111 |
4 | 332232231233233 |
5 | 4123410332031 |
6 | 252233144451 |
7 | 35036351632 |
oct | 7656555757 |
9 | 2640304174 |
10 | 1052433391 |
11 | 4a0086869 |
12 | 25455b127 |
13 | 13a068069 |
14 | 9dab9c19 |
15 | 625dc1b1 |
hex | 3ebadbef |
1052433391 has 8 divisors (see below), whose sum is σ = 1060478480. Its totient is φ = 1044418752.
The previous prime is 1052433373. The next prime is 1052433401. The reversal of 1052433391 is 1933342501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052433391 - 25 = 1052433359 is a prime.
It is a super-2 number, since 2×10524333912 = 2215232084983517762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052433311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64336 + ... + 79018.
It is an arithmetic number, because the mean of its divisors is an integer number (132559810).
Almost surely, 21052433391 is an apocalyptic number.
1052433391 is a deficient number, since it is larger than the sum of its proper divisors (8045089).
1052433391 is a wasteful number, since it uses less digits than its factorization.
1052433391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15225.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 1052433391 is about 32441.2298009801. The cubic root of 1052433391 is about 1017.1809223940.
Adding to 1052433391 its reverse (1933342501), we get a palindrome (2985775892).
The spelling of 1052433391 in words is "one billion, fifty-two million, four hundred thirty-three thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •