Base | Representation |
---|---|
bin | 111110110010100… |
… | …001111000101111 |
3 | 2201102012221221112 |
4 | 332302201320233 |
5 | 4124134332031 |
6 | 252310422235 |
7 | 35051015243 |
oct | 7662417057 |
9 | 2642187845 |
10 | 1053433391 |
11 | 4a06aa10a |
12 | 25496197b |
13 | 13a32828a |
14 | 9dc9a423 |
15 | 6273862b |
hex | 3eca1e2f |
1053433391 has 4 divisors (see below), whose sum is σ = 1055877984. Its totient is φ = 1050988800.
The previous prime is 1053433387. The next prime is 1053433417. The reversal of 1053433391 is 1933343501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1933343501 = 30517 ⋅63353.
It is a cyclic number.
It is not a de Polignac number, because 1053433391 - 22 = 1053433387 is a prime.
It is a super-2 number, since 2×10534333912 = 2219443818547517762, 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 (1053433291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1221650 + ... + 1222511.
It is an arithmetic number, because the mean of its divisors is an integer number (263969496).
Almost surely, 21053433391 is an apocalyptic number.
1053433391 is a deficient number, since it is larger than the sum of its proper divisors (2444593).
1053433391 is an equidigital number, since it uses as much as digits as its factorization.
1053433391 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444592.
The product of its (nonzero) digits is 14580, while the sum is 32.
The square root of 1053433391 is about 32456.6386275597. The cubic root of 1053433391 is about 1017.5029883582.
Adding to 1053433391 its reverse (1933343501), we get a palindrome (2986776892).
The spelling of 1053433391 in words is "one billion, fifty-three million, four hundred thirty-three thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •