Base | Representation |
---|---|
bin | 111101100100101… |
… | …010001010001011 |
3 | 2122222210212002121 |
4 | 331210222022023 |
5 | 4103423120133 |
6 | 250301112111 |
7 | 34412345146 |
oct | 7544521213 |
9 | 2588725077 |
10 | 1033020043 |
11 | 490127280 |
12 | 249b58637 |
13 | 13602b983 |
14 | 9b2a505d |
15 | 60a5502d |
hex | 3d92a28b |
1033020043 has 4 divisors (see below), whose sum is σ = 1126930968. Its totient is φ = 939109120.
The previous prime is 1033020031. The next prime is 1033020059. The reversal of 1033020043 is 3400203301.
1033020043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1033020043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1033019999 and 1033020026.
It is not an unprimeable number, because it can be changed into a prime (1033020013) 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, 46955446 + ... + 46955467.
It is an arithmetic number, because the mean of its divisors is an integer number (281732742).
Almost surely, 21033020043 is an apocalyptic number.
1033020043 is a deficient number, since it is larger than the sum of its proper divisors (93910925).
1033020043 is an equidigital number, since it uses as much as digits as its factorization.
1033020043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93910924.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 1033020043 is about 32140.6291631013. The cubic root of 1033020043 is about 1010.8877085842.
Adding to 1033020043 its reverse (3400203301), we get a palindrome (4433223344).
The spelling of 1033020043 in words is "one billion, thirty-three million, twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •