Base | Representation |
---|---|
bin | 111110111010001… |
… | …010101000100111 |
3 | 2201112222200001102 |
4 | 332322022220213 |
5 | 4130142412203 |
6 | 252421350315 |
7 | 35104023566 |
oct | 7672125047 |
9 | 2645880042 |
10 | 1055435303 |
11 | 4a184718a |
12 | 25556839b |
13 | 13a879540 |
14 | a025bbdd |
15 | 629d1888 |
hex | 3ee8aa27 |
1055435303 has 8 divisors (see below), whose sum is σ = 1137250800. Its totient is φ = 973709568.
The previous prime is 1055435299. The next prime is 1055435317. The reversal of 1055435303 is 3035345501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055435303 - 22 = 1055435299 is a prime.
It is a super-2 number, since 2×10554353032 = 2227887357637403618, 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 (1055435363) 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, 3068 + ... + 46046.
It is an arithmetic number, because the mean of its divisors is an integer number (142156350).
Almost surely, 21055435303 is an apocalyptic number.
1055435303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1055435303 is a deficient number, since it is larger than the sum of its proper divisors (81815497).
1055435303 is a wasteful number, since it uses less digits than its factorization.
1055435303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44881.
The product of its (nonzero) digits is 13500, while the sum is 29.
The square root of 1055435303 is about 32487.4637822037. The cubic root of 1055435303 is about 1018.1471241592.
The spelling of 1055435303 in words is "one billion, fifty-five million, four hundred thirty-five thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •