Base | Representation |
---|---|
bin | 1001100100011… |
… | …1101110001010 |
3 | 2210112022021000 |
4 | 2121013232022 |
5 | 40233432113 |
6 | 3552155430 |
7 | 665116146 |
oct | 231075612 |
9 | 83468230 |
10 | 40139658 |
11 | 20726579 |
12 | 11538b76 |
13 | 84152a0 |
14 | 548c226 |
15 | 37cd373 |
hex | 2647b8a |
40139658 has 32 divisors (see below), whose sum is σ = 96062400. Its totient is φ = 12350448.
The previous prime is 40139653. The next prime is 40139677. The reversal of 40139658 is 85693104.
40139658 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×401396582 = 3222384288713928, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40139651) 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, 27888 + ... + 29291.
It is an arithmetic number, because the mean of its divisors is an integer number (3001950).
Almost surely, 240139658 is an apocalyptic number.
40139658 is an abundant number, since it is smaller than the sum of its proper divisors (55922742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40139658 is a wasteful number, since it uses less digits than its factorization.
40139658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57203 (or 57197 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 40139658 is about 6335.5866342431. The cubic root of 40139658 is about 342.3927467111.
It can be divided in two parts, 40139 and 658, that multiplied together give a palindrome (26411462).
The spelling of 40139658 in words is "forty million, one hundred thirty-nine thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •