Base | Representation |
---|---|
bin | 100010111110101010111111… |
… | …111001011110011011111101 |
3 | 202011200222212001210220010021 |
4 | 202332222333321132123331 |
5 | 130131010023134421021 |
6 | 1303105141310412141 |
7 | 44255412326202445 |
oct | 4276527771363375 |
9 | 664628761726107 |
10 | 153840358123261 |
11 | 45022369607007 |
12 | 15307360801051 |
13 | 67ac111666494 |
14 | 29dbcad629125 |
15 | 12bbb1a0dcc41 |
hex | 8beabfe5e6fd |
153840358123261 has 2 divisors, whose sum is σ = 153840358123262. Its totient is φ = 153840358123260.
The previous prime is 153840358123223. The next prime is 153840358123289. The reversal of 153840358123261 is 162321853048351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108469100522500 + 45371257600761 = 10414850^2 + 6735819^2 .
It is a cyclic number.
It is not a de Polignac number, because 153840358123261 - 215 = 153840358090493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153840358123199 and 153840358123208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153840358124261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76920179061630 + 76920179061631.
It is an arithmetic number, because the mean of its divisors is an integer number (76920179061631).
Almost surely, 2153840358123261 is an apocalyptic number.
It is an amenable number.
153840358123261 is a deficient number, since it is larger than the sum of its proper divisors (1).
153840358123261 is an equidigital number, since it uses as much as digits as its factorization.
153840358123261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4147200, while the sum is 52.
The spelling of 153840358123261 in words is "one hundred fifty-three trillion, eight hundred forty billion, three hundred fifty-eight million, one hundred twenty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •