Base | Representation |
---|---|
bin | 10000101111111… |
… | …01111111011001 |
3 | 100210101012002000 |
4 | 20113331333121 |
5 | 241432012303 |
6 | 21535231213 |
7 | 3324144525 |
oct | 1027757731 |
9 | 323335060 |
10 | 140500953 |
11 | 7234449a |
12 | 3b078509 |
13 | 23154378 |
14 | 14934d85 |
15 | c504da3 |
hex | 85fdfd9 |
140500953 has 16 divisors (see below), whose sum is σ = 219105600. Its totient is φ = 88737120.
The previous prime is 140500939. The next prime is 140500957. The reversal of 140500953 is 359005041.
It is not a de Polignac number, because 140500953 - 213 = 140492761 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140500957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136428 + ... + 137453.
It is an arithmetic number, because the mean of its divisors is an integer number (13694100).
Almost surely, 2140500953 is an apocalyptic number.
It is an amenable number.
140500953 is a deficient number, since it is larger than the sum of its proper divisors (78604647).
140500953 is a wasteful number, since it uses less digits than its factorization.
140500953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273909 (or 273903 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 140500953 is about 11853.3097909403. The cubic root of 140500953 is about 519.8680052059.
Adding to 140500953 its reverse (359005041), we get a palindrome (499505994).
The spelling of 140500953 in words is "one hundred forty million, five hundred thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •