Base | Representation |
---|---|
bin | 11111111011100001111010… |
… | …001101101110110110000001 |
3 | 200102020000011010201210211021 |
4 | 133323201322031232312001 |
5 | 121401302224042130423 |
6 | 1214400442325345441 |
7 | 41402516526403231 |
oct | 3773417215566601 |
9 | 612200133653737 |
10 | 140430301130113 |
11 | 40822179a83135 |
12 | 139003bb868281 |
13 | 604869c919117 |
14 | 2696c118c3cc1 |
15 | 1137dab19295d |
hex | 7fb87a36ed81 |
140430301130113 has 4 divisors (see below), whose sum is σ = 140430418903600. Its totient is φ = 140430183356628.
The previous prime is 140430301130099. The next prime is 140430301130143. The reversal of 140430301130113 is 311031103034041.
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.
It is a cyclic number.
It is not a de Polignac number, because 140430301130113 - 217 = 140430300999041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140430301130143) 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, 57079695 + ... + 59489092.
It is an arithmetic number, because the mean of its divisors is an integer number (35107604725900).
Almost surely, 2140430301130113 is an apocalyptic number.
It is an amenable number.
140430301130113 is a deficient number, since it is larger than the sum of its proper divisors (117773487).
140430301130113 is a wasteful number, since it uses less digits than its factorization.
140430301130113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117773486.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 140430301130113 its reverse (311031103034041), we get a palindrome (451461404164154).
The spelling of 140430301130113 in words is "one hundred forty trillion, four hundred thirty billion, three hundred one million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •