Base | Representation |
---|---|
bin | 1010001010011… |
… | …1001111010001 |
3 | 2222012201200122 |
4 | 2202213033101 |
5 | 41403044144 |
6 | 4121400025 |
7 | 1025222012 |
oct | 242471721 |
9 | 88181618 |
10 | 42628049 |
11 | 220760a2 |
12 | 12339015 |
13 | 8aa6ac9 |
14 | 5939009 |
15 | 3b207ee |
hex | 28a73d1 |
42628049 has 4 divisors (see below), whose sum is σ = 42811236. Its totient is φ = 42444864.
The previous prime is 42628043. The next prime is 42628067. The reversal of 42628049 is 94082624.
42628049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6927424 + 35700625 = 2632^2 + 5975^2 .
It is a cyclic number.
It is not a de Polignac number, because 42628049 - 212 = 42623953 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (42628043) 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 3 ways as a sum of consecutive naturals, for example, 91244 + ... + 91709.
It is an arithmetic number, because the mean of its divisors is an integer number (10702809).
Almost surely, 242628049 is an apocalyptic number.
It is an amenable number.
42628049 is a deficient number, since it is larger than the sum of its proper divisors (183187).
42628049 is a wasteful number, since it uses less digits than its factorization.
42628049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183186.
The product of its (nonzero) digits is 27648, while the sum is 35.
The square root of 42628049 is about 6529.0159289130. The cubic root of 42628049 is about 349.3267301996.
The spelling of 42628049 in words is "forty-two million, six hundred twenty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •