Base | Representation |
---|---|
bin | 111110110100111… |
… | …001010000111001 |
3 | 2201110101110111001 |
4 | 332310321100321 |
5 | 4124314202213 |
6 | 252332005001 |
7 | 35056210036 |
oct | 7664712071 |
9 | 2643343431 |
10 | 1054053433 |
11 | 4a0a92a44 |
12 | 255000761 |
13 | 13a4b4574 |
14 | 9ddbc38d |
15 | 6280c1dd |
hex | 3ed39439 |
1054053433 has 8 divisors (see below), whose sum is σ = 1080915840. Its totient is φ = 1027524960.
The previous prime is 1054053421. The next prime is 1054053439. The reversal of 1054053433 is 3343504501.
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 1054053433 - 229 = 517182521 is a prime.
It is a super-2 number, since 2×10540534332 = 2222057279238170978, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1054053439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77085 + ... + 89722.
It is an arithmetic number, because the mean of its divisors is an integer number (135114480).
Almost surely, 21054053433 is an apocalyptic number.
It is an amenable number.
1054053433 is a deficient number, since it is larger than the sum of its proper divisors (26862407).
1054053433 is an equidigital number, since it uses as much as digits as its factorization.
1054053433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166967.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 1054053433 is about 32466.1890741738. The cubic root of 1054053433 is about 1017.7025804267.
Adding to 1054053433 its reverse (3343504501), we get a palindrome (4397557934).
The spelling of 1054053433 in words is "one billion, fifty-four million, fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •