Base | Representation |
---|---|
bin | 11001111011000110011010… |
… | …101100000111110111011101 |
3 | 112221200111012022012111110022 |
4 | 121323012122230013313131 |
5 | 104420440101021131031 |
6 | 1042252342001521525 |
7 | 33005063042054666 |
oct | 3173063254076735 |
9 | 487614168174408 |
10 | 114012502130141 |
11 | 3336748117521a |
12 | 109544783432a5 |
13 | 4b80443281224 |
14 | 202233d84a36d |
15 | d2aad807797b |
hex | 67b19ab07ddd |
114012502130141 has 16 divisors (see below), whose sum is σ = 114926027636160. Its totient is φ = 113103239518080.
The previous prime is 114012502130099. The next prime is 114012502130209. The reversal of 114012502130141 is 141031205210411.
It is a cyclic number.
It is not a de Polignac number, because 114012502130141 - 26 = 114012502130077 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114012502130141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114012502130441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82410866 + ... + 83782908.
It is an arithmetic number, because the mean of its divisors is an integer number (7182876727260).
Almost surely, 2114012502130141 is an apocalyptic number.
It is an amenable number.
114012502130141 is a deficient number, since it is larger than the sum of its proper divisors (913525506019).
114012502130141 is a wasteful number, since it uses less digits than its factorization.
114012502130141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1373596.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 114012502130141 its reverse (141031205210411), we get a palindrome (255043707340552).
The spelling of 114012502130141 in words is "one hundred fourteen trillion, twelve billion, five hundred two million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •