Base | Representation |
---|---|
bin | 10000110000011… |
… | …10100110001001 |
3 | 100210111122101010 |
4 | 20120032212021 |
5 | 241441201334 |
6 | 21540514133 |
7 | 3324550032 |
oct | 1030164611 |
9 | 323448333 |
10 | 140568969 |
11 | 72390602 |
12 | 3b0ab949 |
13 | 23179308 |
14 | 14951a89 |
15 | c51a0e9 |
hex | 860e989 |
140568969 has 8 divisors (see below), whose sum is σ = 187581760. Its totient is φ = 93634416.
The previous prime is 140568959. The next prime is 140568979. The reversal of 140568969 is 969865041.
It is an interprime number because it is at equal distance from previous prime (140568959) and next prime (140568979).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140568969 - 217 = 140437897 is a prime.
It is a super-2 number, since 2×1405689692 = 39519270091445922, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140568919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15229 + ... + 22650.
It is an arithmetic number, because the mean of its divisors is an integer number (23447720).
Almost surely, 2140568969 is an apocalyptic number.
It is an amenable number.
140568969 is a deficient number, since it is larger than the sum of its proper divisors (47012791).
140568969 is a wasteful number, since it uses less digits than its factorization.
140568969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39119.
The product of its (nonzero) digits is 466560, while the sum is 48.
The square root of 140568969 is about 11856.1785158625. The cubic root of 140568969 is about 519.9518804092.
The spelling of 140568969 in words is "one hundred forty million, five hundred sixty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •