Base | Representation |
---|---|
bin | 10000101110000… |
… | …10110000000101 |
3 | 100202220212020012 |
4 | 20113002300011 |
5 | 241401231214 |
6 | 21530120005 |
7 | 3322114232 |
oct | 1027026005 |
9 | 322825205 |
10 | 140258309 |
11 | 72199164 |
12 | 3ab80005 |
13 | 2309aaa9 |
14 | 148b0789 |
15 | c4a803e |
hex | 85c2c05 |
140258309 has 4 divisors (see below), whose sum is σ = 140320320. Its totient is φ = 140196300.
The previous prime is 140258273. The next prime is 140258317. The reversal of 140258309 is 903852041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 903852041 = 383 ⋅2359927.
It is a cyclic number.
It is not a de Polignac number, because 140258309 - 224 = 123481093 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140258359) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27479 + ... + 32180.
It is an arithmetic number, because the mean of its divisors is an integer number (35080080).
Almost surely, 2140258309 is an apocalyptic number.
It is an amenable number.
140258309 is a deficient number, since it is larger than the sum of its proper divisors (62011).
140258309 is an equidigital number, since it uses as much as digits as its factorization.
140258309 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62010.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 140258309 is about 11843.0700833863. The cubic root of 140258309 is about 519.5685634934.
It can be divided in two parts, 140 and 258309, that multiplied together give a triangular number (36163260 = T8504).
The spelling of 140258309 in words is "one hundred forty million, two hundred fifty-eight thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •