Base | Representation |
---|---|
bin | 100010111011000011110001… |
… | …101111010010101001000101 |
3 | 202010211021000120101222220211 |
4 | 202323003301233102221011 |
5 | 130112423043032224031 |
6 | 1302355121425555421 |
7 | 44231443035600664 |
oct | 4273036157225105 |
9 | 663737016358824 |
10 | 153592086211141 |
11 | 44a3704658a866 |
12 | 15287212aa5b71 |
13 | 67918966096c6 |
14 | 29cdc7a530ddb |
15 | 12b5438d74bb1 |
hex | 8bb0f1bd2a45 |
153592086211141 has 2 divisors, whose sum is σ = 153592086211142. Its totient is φ = 153592086211140.
The previous prime is 153592086211133. The next prime is 153592086211219. The reversal of 153592086211141 is 141112680295351.
153592086211141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114317474044225 + 39274612166916 = 10691935^2 + 6266946^2 .
It is a cyclic number.
It is not a de Polignac number, because 153592086211141 - 23 = 153592086211133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153592086211541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76796043105570 + 76796043105571.
It is an arithmetic number, because the mean of its divisors is an integer number (76796043105571).
Almost surely, 2153592086211141 is an apocalyptic number.
It is an amenable number.
153592086211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
153592086211141 is an equidigital number, since it uses as much as digits as its factorization.
153592086211141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 518400, while the sum is 49.
The spelling of 153592086211141 in words is "one hundred fifty-three trillion, five hundred ninety-two billion, eighty-six million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •