Base | Representation |
---|---|
bin | 1010000000111… |
… | …0101111001101 |
3 | 2221000222211200 |
4 | 2200032233031 |
5 | 41223102110 |
6 | 4100140113 |
7 | 1020010623 |
oct | 240165715 |
9 | 87028750 |
10 | 42003405 |
11 | 21789864 |
12 | 12097639 |
13 | 89186b2 |
14 | 5815513 |
15 | 3a4a6c0 |
hex | 280ebcd |
42003405 has 24 divisors (see below), whose sum is σ = 75973248. Its totient is φ = 21427296.
The previous prime is 42003391. The next prime is 42003407. The reversal of 42003405 is 50430024.
It is a happy number.
42003405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42003405 - 28 = 42003149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42003407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19257 + ... + 21326.
It is an arithmetic number, because the mean of its divisors is an integer number (3165552).
Almost surely, 242003405 is an apocalyptic number.
42003405 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
42003405 is a deficient number, since it is larger than the sum of its proper divisors (33969843).
42003405 is a wasteful number, since it uses less digits than its factorization.
42003405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40617 (or 40614 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 18.
The square root of 42003405 is about 6481.0033945370. The cubic root of 42003405 is about 347.6120577830.
Adding to 42003405 its reverse (50430024), we get a palindrome (92433429).
The spelling of 42003405 in words is "forty-two million, three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •