Base | Representation |
---|---|
bin | 100000000101011101000110… |
… | …111001100101100011110110 |
3 | 200111122012121121012211102210 |
4 | 200011131012321211203312 |
5 | 121443441033020330004 |
6 | 1220042040345514250 |
7 | 41503013222262603 |
oct | 4005350671454366 |
9 | 614565547184383 |
10 | 141112340011254 |
11 | 40a65453166347 |
12 | 139b06251a2986 |
13 | 6097ab4c19c81 |
14 | 26bbc335dd6aa |
15 | 114a9c84c2089 |
hex | 805746e658f6 |
141112340011254 has 8 divisors (see below), whose sum is σ = 282224680022520. Its totient is φ = 47037446670416.
The previous prime is 141112340011219. The next prime is 141112340011283. The reversal of 141112340011254 is 452110043211141.
It is a sphenic number, since it is the product of 3 distinct primes.
141112340011254 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11759361667599 + ... + 11759361667610.
It is an arithmetic number, because the mean of its divisors is an integer number (35278085002815).
Almost surely, 2141112340011254 is an apocalyptic number.
141112340011254 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141112340011254 is a wasteful number, since it uses less digits than its factorization.
141112340011254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23518723335214.
The product of its (nonzero) digits is 3840, while the sum is 30.
Adding to 141112340011254 its reverse (452110043211141), we get a palindrome (593222383222395).
The spelling of 141112340011254 in words is "one hundred forty-one trillion, one hundred twelve billion, three hundred forty million, eleven thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •