Base | Representation |
---|---|
bin | 1001101011101… |
… | …1000100001110 |
3 | 2211102022100020 |
4 | 2122323010032 |
5 | 40344041420 |
6 | 4010243010 |
7 | 1002124440 |
oct | 232730416 |
9 | 84368306 |
10 | 40612110 |
11 | 20a19530 |
12 | 11726466 |
13 | 854c346 |
14 | 5572490 |
15 | 3873340 |
hex | 26bb10e |
40612110 has 64 divisors (see below), whose sum is σ = 121526784. Its totient is φ = 8438400.
The previous prime is 40612097. The next prime is 40612111. The reversal of 40612110 is 1121604.
40612110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 40612110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40612111) 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 31 ways as a sum of consecutive naturals, for example, 6481 + ... + 11100.
It is an arithmetic number, because the mean of its divisors is an integer number (1898856).
Almost surely, 240612110 is an apocalyptic number.
40612110 is an abundant number, since it is smaller than the sum of its proper divisors (80914674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40612110 is a wasteful number, since it uses less digits than its factorization.
40612110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17609.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 40612110 is about 6372.7631369760. The cubic root of 40612110 is about 343.7308546913.
Adding to 40612110 its reverse (1121604), we get a palindrome (41733714).
The spelling of 40612110 in words is "forty million, six hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •