Base | Representation |
---|---|
bin | 100000000101101000001100… |
… | …110111100100100101101101 |
3 | 200111200100100201102022112101 |
4 | 200011220030313210211231 |
5 | 121444134431313300344 |
6 | 1220051330330135101 |
7 | 41503614335516503 |
oct | 4005501467444555 |
9 | 614610321368471 |
10 | 141124251306349 |
11 | 40a6a505840683 |
12 | 139b29aa281491 |
13 | 6098c6289418c |
14 | 26bc64352a673 |
15 | 114ae7406e9d4 |
hex | 805a0cde496d |
141124251306349 has 2 divisors, whose sum is σ = 141124251306350. Its totient is φ = 141124251306348.
The previous prime is 141124251306341. The next prime is 141124251306377. The reversal of 141124251306349 is 943603152421141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137151034322500 + 3973216983849 = 11711150^2 + 1993293^2 .
It is a cyclic number.
It is not a de Polignac number, because 141124251306349 - 23 = 141124251306341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141124251306299 and 141124251306308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141124251306341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70562125653174 + 70562125653175.
It is an arithmetic number, because the mean of its divisors is an integer number (70562125653175).
Almost surely, 2141124251306349 is an apocalyptic number.
It is an amenable number.
141124251306349 is a deficient number, since it is larger than the sum of its proper divisors (1).
141124251306349 is an equidigital number, since it uses as much as digits as its factorization.
141124251306349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 46.
The spelling of 141124251306349 in words is "one hundred forty-one trillion, one hundred twenty-four billion, two hundred fifty-one million, three hundred six thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •