Base | Representation |
---|---|
bin | 1000001010101010110… |
… | …1100001000111011001 |
3 | 111102010221212111111110 |
4 | 2002222231201013121 |
5 | 4244320032343223 |
6 | 144242044250533 |
7 | 13064560633062 |
oct | 2025255410731 |
9 | 442127774443 |
10 | 140303012313 |
11 | 54558435842 |
12 | 23237240a49 |
13 | 102cc5a5c19 |
14 | 6b0d987569 |
15 | 39b2627d93 |
hex | 20aab611d9 |
140303012313 has 8 divisors (see below), whose sum is σ = 193105221376. Its totient is φ = 90518072400.
The previous prime is 140303012299. The next prime is 140303012347. The reversal of 140303012313 is 313210303041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140303012313 - 25 = 140303012281 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 140303012313.
It is not an unprimeable number, because it can be changed into a prime (140303012713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 754317178 + ... + 754317363.
It is an arithmetic number, because the mean of its divisors is an integer number (24138152672).
Almost surely, 2140303012313 is an apocalyptic number.
It is an amenable number.
140303012313 is a deficient number, since it is larger than the sum of its proper divisors (52802209063).
140303012313 is a wasteful number, since it uses less digits than its factorization.
140303012313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1508634575.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 140303012313 its reverse (313210303041), we get a palindrome (453513315354).
The spelling of 140303012313 in words is "one hundred forty billion, three hundred three million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •