Base | Representation |
---|---|
bin | 10010100001111… |
… | …10111100010001 |
3 | 101211111112021102 |
4 | 21100332330101 |
5 | 304243301212 |
6 | 23231434145 |
7 | 3565164263 |
oct | 1120767421 |
9 | 354445242 |
10 | 155447057 |
11 | 7a822747 |
12 | 44085955 |
13 | 2628830c |
14 | 16905b33 |
15 | d9a85c2 |
hex | 943ef11 |
155447057 has 2 divisors, whose sum is σ = 155447058. Its totient is φ = 155447056.
The previous prime is 155447029. The next prime is 155447063. The reversal of 155447057 is 750744551.
155447057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136515856 + 18931201 = 11684^2 + 4351^2 .
It is a cyclic number.
It is not a de Polignac number, because 155447057 - 28 = 155446801 is a prime.
It is a super-2 number, since 2×1554470572 = 48327575059922498, 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 155447057.
It is not a weakly prime, because it can be changed into another prime (155447657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77723528 + 77723529.
It is an arithmetic number, because the mean of its divisors is an integer number (77723529).
Almost surely, 2155447057 is an apocalyptic number.
It is an amenable number.
155447057 is a deficient number, since it is larger than the sum of its proper divisors (1).
155447057 is an equidigital number, since it uses as much as digits as its factorization.
155447057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 98000, while the sum is 38.
The square root of 155447057 is about 12467.8409117216. The cubic root of 155447057 is about 537.6844805370.
The spelling of 155447057 in words is "one hundred fifty-five million, four hundred forty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •