Base | Representation |
---|---|
bin | 1010001011000… |
… | …1100011100001 |
3 | 2222021212122200 |
4 | 2202301203201 |
5 | 41410422210 |
6 | 4122323413 |
7 | 1025456136 |
oct | 242614341 |
9 | 88255580 |
10 | 42670305 |
11 | 220a4917 |
12 | 12359569 |
13 | 8ac0102 |
14 | 594a58d |
15 | 3b2d0c0 |
hex | 28b18e1 |
42670305 has 24 divisors (see below), whose sum is σ = 74256000. Its totient is φ = 22667040.
The previous prime is 42670301. The next prime is 42670363. The reversal of 42670305 is 50307624.
It is a happy number.
It is not a de Polignac number, because 42670305 - 22 = 42670301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42670301) 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 23 ways as a sum of consecutive naturals, for example, 10446 + ... + 13944.
It is an arithmetic number, because the mean of its divisors is an integer number (3094000).
Almost surely, 242670305 is an apocalyptic number.
42670305 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
42670305 is a deficient number, since it is larger than the sum of its proper divisors (31585695).
42670305 is a wasteful number, since it uses less digits than its factorization.
42670305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3781 (or 3778 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 42670305 is about 6532.2511433655. The cubic root of 42670305 is about 349.4421180401.
Adding to 42670305 its reverse (50307624), we get a palindrome (92977929).
It can be divided in two parts, 426 and 70305, that multiplied together give a triangular number (29949930 = T7739).
The spelling of 42670305 in words is "forty-two million, six hundred seventy thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •