Base | Representation |
---|---|
bin | 1001101011011… |
… | …0000101101010 |
3 | 2211101021101010 |
4 | 2122312011222 |
5 | 40342413342 |
6 | 4010004350 |
7 | 1002011133 |
oct | 232660552 |
9 | 84337333 |
10 | 40591722 |
11 | 20a05186 |
12 | 117166b6 |
13 | 8542c92 |
14 | 5568c8a |
15 | 386c29c |
hex | 26b616a |
40591722 has 32 divisors (see below), whose sum is σ = 83772864. Its totient is φ = 13104000.
The previous prime is 40591717. The next prime is 40591729. The reversal of 40591722 is 22719504.
40591722 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 40591722.
It is not an unprimeable number, because it can be changed into a prime (40591729) 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, 38097 + ... + 39147.
It is an arithmetic number, because the mean of its divisors is an integer number (2617902).
Almost surely, 240591722 is an apocalyptic number.
40591722 is an abundant number, since it is smaller than the sum of its proper divisors (43181142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40591722 is a wasteful number, since it uses less digits than its factorization.
40591722 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 40591722 is about 6371.1633160672. The cubic root of 40591722 is about 343.6733254001.
The spelling of 40591722 in words is "forty million, five hundred ninety-one thousand, seven hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •