Base | Representation |
---|---|
bin | 1010000101011… |
… | …1011111111011 |
3 | 2221121010122211 |
4 | 2201113133323 |
5 | 41312121220 |
6 | 4110355551 |
7 | 1022361541 |
oct | 241273773 |
9 | 87533584 |
10 | 42301435 |
11 | 21972770 |
12 | 121bbbb7 |
13 | 89c1247 |
14 | 5891d91 |
15 | 3aa8b5a |
hex | 28577fb |
42301435 has 8 divisors (see below), whose sum is σ = 55376496. Its totient is φ = 30764640.
The previous prime is 42301421. The next prime is 42301447. The reversal of 42301435 is 53410324.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42301435 - 213 = 42293243 is a prime.
It is a super-2 number, since 2×423014352 = 3578822806118450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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, 384504 + ... + 384613.
It is an arithmetic number, because the mean of its divisors is an integer number (6922062).
Almost surely, 242301435 is an apocalyptic number.
42301435 is a deficient number, since it is larger than the sum of its proper divisors (13075061).
42301435 is a wasteful number, since it uses less digits than its factorization.
42301435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769133.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 42301435 is about 6503.9553350250. The cubic root of 42301435 is about 348.4322671498.
Adding to 42301435 its reverse (53410324), we get a palindrome (95711759).
Subtracting 42301435 from its reverse (53410324), we obtain a square (11108889 = 33332).
It can be divided in two parts, 4230 and 1435, that added together give a palindrome (5665).
The spelling of 42301435 in words is "forty-two million, three hundred one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •