Base | Representation |
---|---|
bin | 1010001101001… |
… | …0000100110011 |
3 | 2222112122101002 |
4 | 2203102010303 |
5 | 41424203012 |
6 | 4125232215 |
7 | 1026552365 |
oct | 243220463 |
9 | 88478332 |
10 | 42803507 |
11 | 221859aa |
12 | 1240266b |
13 | 8b38926 |
14 | 5982d35 |
15 | 3b577c2 |
hex | 28d2133 |
42803507 has 8 divisors (see below), whose sum is σ = 44508000. Its totient is φ = 41114304.
The previous prime is 42803503. The next prime is 42803539. The reversal of 42803507 is 70530824.
It is a happy number.
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 42803507 - 22 = 42803503 is a prime.
It is a super-2 number, since 2×428035072 = 3664280422998098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42803507.
It is not an unprimeable number, because it can be changed into a prime (42803503) 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 7 ways as a sum of consecutive naturals, for example, 2063 + ... + 9479.
It is an arithmetic number, because the mean of its divisors is an integer number (5563500).
Almost surely, 242803507 is an apocalyptic number.
42803507 is a deficient number, since it is larger than the sum of its proper divisors (1704493).
42803507 is a wasteful number, since it uses less digits than its factorization.
42803507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7645.
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 42803507 is about 6542.4389183240. The cubic root of 42803507 is about 349.8053529947.
The spelling of 42803507 in words is "forty-two million, eight hundred three thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •