Base | Representation |
---|---|
bin | 10000101100111… |
… | …01000101100011 |
3 | 100202122000121100 |
4 | 20112131011203 |
5 | 241331312120 |
6 | 21522525443 |
7 | 3320602401 |
oct | 1026350543 |
9 | 322560540 |
10 | 140104035 |
11 | 720a3265 |
12 | 3ab06883 |
13 | 230457c6 |
14 | 14870471 |
15 | c477490 |
hex | 859d163 |
140104035 has 48 divisors (see below), whose sum is σ = 254592000. Its totient is φ = 71184960.
The previous prime is 140104031. The next prime is 140104037. The reversal of 140104035 is 530401041.
It is a happy number.
It is not a de Polignac number, because 140104035 - 22 = 140104031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140103999 and 140104017.
It is not an unprimeable number, because it can be changed into a prime (140104031) 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 47 ways as a sum of consecutive naturals, for example, 92716 + ... + 94214.
It is an arithmetic number, because the mean of its divisors is an integer number (5304000).
Almost surely, 2140104035 is an apocalyptic number.
140104035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140104035 is a deficient number, since it is larger than the sum of its proper divisors (114487965).
140104035 is a wasteful number, since it uses less digits than its factorization.
140104035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1608 (or 1605 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 140104035 is about 11836.5550309201. Note that the first 3 decimals coincide. The cubic root of 140104035 is about 519.3779976542.
Adding to 140104035 its reverse (530401041), we get a palindrome (670505076).
The spelling of 140104035 in words is "one hundred forty million, one hundred four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •