Base | Representation |
---|---|
bin | 1001101010101… |
… | …1010100100110 |
3 | 2211022000212210 |
4 | 2122223110212 |
5 | 40340010442 |
6 | 4005024250 |
7 | 1001435433 |
oct | 232532446 |
9 | 84260783 |
10 | 40547622 |
11 | 20985035 |
12 | 116b5086 |
13 | 8528b9b |
14 | 5556b8a |
15 | 385e19c |
hex | 26ab526 |
40547622 has 8 divisors (see below), whose sum is σ = 81095256. Its totient is φ = 13515872.
The previous prime is 40547609. The next prime is 40547627. The reversal of 40547622 is 22674504.
40547622 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
40547622 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 40547622.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40547627) 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, 3378963 + ... + 3378974.
It is an arithmetic number, because the mean of its divisors is an integer number (10136907).
Almost surely, 240547622 is an apocalyptic number.
40547622 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40547622 is a wasteful number, since it uses less digits than its factorization.
40547622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6757942.
The product of its (nonzero) digits is 13440, while the sum is 30.
The square root of 40547622 is about 6367.7014691331. The cubic root of 40547622 is about 343.5488214795.
The spelling of 40547622 in words is "forty million, five hundred forty-seven thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.430 sec. • engine limits •