Base | Representation |
---|---|
bin | 100000000101011100111011… |
… | …101100100011011011110101 |
3 | 200111122012010111112011121211 |
4 | 200011130323230203123311 |
5 | 121443440141410422201 |
6 | 1220042005553041421 |
7 | 41503005450506113 |
oct | 4005347354433365 |
9 | 614565114464554 |
10 | 141112152045301 |
11 | 40a65367052788 |
12 | 139b0592256271 |
13 | 6097a84cb7308 |
14 | 26bbc16670ab3 |
15 | 114a9b6c43651 |
hex | 80573bb236f5 |
141112152045301 has 8 divisors (see below), whose sum is σ = 143778885576480. Its totient is φ = 138445575554832.
The previous prime is 141112152045217. The next prime is 141112152045307. The reversal of 141112152045301 is 103540251211141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141112152045301 - 29 = 141112152044789 is a prime.
It is a super-2 number, since 2×1411121520453012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141112152045307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37445271 + ... + 41041108.
It is an arithmetic number, because the mean of its divisors is an integer number (17972360697060).
Almost surely, 2141112152045301 is an apocalyptic number.
It is an amenable number.
141112152045301 is a deficient number, since it is larger than the sum of its proper divisors (2666733531179).
141112152045301 is an equidigital number, since it uses as much as digits as its factorization.
141112152045301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78520355.
The product of its (nonzero) digits is 4800, while the sum is 31.
The spelling of 141112152045301 in words is "one hundred forty-one trillion, one hundred twelve billion, one hundred fifty-two million, forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •