Base | Representation |
---|---|
bin | 1010001100010… |
… | …1110001010001 |
3 | 2222110002020100 |
4 | 2203011301101 |
5 | 41421044410 |
6 | 4124203013 |
7 | 1026252423 |
oct | 243056121 |
9 | 88402210 |
10 | 42753105 |
11 | 2215104a |
12 | 12399469 |
13 | 8b1b9c5 |
14 | 596c813 |
15 | 3b478c0 |
hex | 28c5c51 |
42753105 has 36 divisors (see below), whose sum is σ = 77086620. Its totient is φ = 21893760.
The previous prime is 42753101. The next prime is 42753157. The reversal of 42753105 is 50135724.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 19395216 + 23357889 = 4404^2 + 4833^2 .
It is not a de Polignac number, because 42753105 - 22 = 42753101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42753101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 236115 + ... + 236295.
It is an arithmetic number, because the mean of its divisors is an integer number (2141295).
Almost surely, 242753105 is an apocalyptic number.
42753105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
42753105 is a deficient number, since it is larger than the sum of its proper divisors (34333515).
42753105 is a wasteful number, since it uses less digits than its factorization.
42753105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 42753105 is about 6538.5858562842. The cubic root of 42753105 is about 349.6679980954.
Adding to 42753105 its reverse (50135724), we get a palindrome (92888829).
The spelling of 42753105 in words is "forty-two million, seven hundred fifty-three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.045 sec. • engine limits •