Base | Representation |
---|---|
bin | 1011001010011… |
… | …0101110010001 |
3 | 10021002201022000 |
4 | 2302212232101 |
5 | 43441221431 |
6 | 4351304213 |
7 | 1105652106 |
oct | 262465621 |
9 | 107081260 |
10 | 46820241 |
11 | 24479816 |
12 | 1381b069 |
13 | 9913cb0 |
14 | 630aaad |
15 | 419c9e6 |
hex | 2ca6b91 |
46820241 has 16 divisors (see below), whose sum is σ = 74699520. Its totient is φ = 28812240.
The previous prime is 46820231. The next prime is 46820243. The reversal of 46820241 is 14202864.
46820241 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 46820241 - 25 = 46820209 is a prime.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (46820243) 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 15 ways as a sum of consecutive naturals, for example, 66345 + ... + 67046.
It is an arithmetic number, because the mean of its divisors is an integer number (4668720).
Almost surely, 246820241 is an apocalyptic number.
It is an amenable number.
46820241 is a deficient number, since it is larger than the sum of its proper divisors (27879279).
46820241 is a wasteful number, since it uses less digits than its factorization.
46820241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133413 (or 133407 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 46820241 is about 6842.5317682858. The cubic root of 46820241 is about 360.4219358350.
The spelling of 46820241 in words is "forty-six million, eight hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •