Base | Representation |
---|---|
bin | 10000101110011… |
… | …01011011011001 |
3 | 100210000002012220 |
4 | 20113031123121 |
5 | 241404131131 |
6 | 21531054253 |
7 | 3322355565 |
oct | 1027153331 |
9 | 323002186 |
10 | 140302041 |
11 | 72219000 |
12 | 3aba1389 |
13 | 230b4979 |
14 | 148c26a5 |
15 | c4b5e96 |
hex | 85cd6d9 |
140302041 has 32 divisors (see below), whose sum is σ = 211026816. Its totient is φ = 82860800.
The previous prime is 140302033. The next prime is 140302049. The reversal of 140302041 is 140203041.
It is an interprime number because it is at equal distance from previous prime (140302033) and next prime (140302049).
It is not a de Polignac number, because 140302041 - 23 = 140302033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140302041.
It is not an unprimeable number, because it can be changed into a prime (140302049) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163285 + ... + 164141.
It is an arithmetic number, because the mean of its divisors is an integer number (6594588).
Almost surely, 2140302041 is an apocalyptic number.
140302041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140302041 is a deficient number, since it is larger than the sum of its proper divisors (70724775).
140302041 is an equidigital number, since it uses as much as digits as its factorization.
140302041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934 (or 912 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 140302041 is about 11844.9162512869. The cubic root of 140302041 is about 519.6225577071.
Adding to 140302041 its reverse (140203041), we get a palindrome (280505082).
The spelling of 140302041 in words is "one hundred forty million, three hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •