Base | Representation |
---|---|
bin | 10010100100011… |
… | …11010010001101 |
3 | 101212010020200201 |
4 | 21102033102031 |
5 | 304334314031 |
6 | 23242453501 |
7 | 3601034563 |
oct | 1122172215 |
9 | 355106621 |
10 | 155776141 |
11 | 7aa27a14 |
12 | 44204291 |
13 | 26372041 |
14 | 1698da33 |
15 | da20d61 |
hex | 948f48d |
155776141 has 2 divisors, whose sum is σ = 155776142. Its totient is φ = 155776140.
The previous prime is 155776123. The next prime is 155776157. The reversal of 155776141 is 141677551.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128255625 + 27520516 = 11325^2 + 5246^2 .
It is a cyclic number.
It is not a de Polignac number, because 155776141 - 25 = 155776109 is a prime.
It is a super-2 number, since 2×1557761412 = 48532412209703762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 155776141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155776121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77888070 + 77888071.
It is an arithmetic number, because the mean of its divisors is an integer number (77888071).
Almost surely, 2155776141 is an apocalyptic number.
It is an amenable number.
155776141 is a deficient number, since it is larger than the sum of its proper divisors (1).
155776141 is an equidigital number, since it uses as much as digits as its factorization.
155776141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29400, while the sum is 37.
The square root of 155776141 is about 12481.0312474571. The cubic root of 155776141 is about 538.0636420891.
The spelling of 155776141 in words is "one hundred fifty-five million, seven hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •