Base | Representation |
---|---|
bin | 10010011110111… |
… | …11100000110101 |
3 | 101210202200002112 |
4 | 21033133200311 |
5 | 304143244211 |
6 | 23215220405 |
7 | 3561645560 |
oct | 1117374065 |
9 | 353680075 |
10 | 155056181 |
11 | 7a586005 |
12 | 43b17705 |
13 | 2617c427 |
14 | 168434d7 |
15 | d92c88b |
hex | 93df835 |
155056181 has 4 divisors (see below), whose sum is σ = 177207072. Its totient is φ = 132905292.
The previous prime is 155056147. The next prime is 155056199. The reversal of 155056181 is 181650551.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 181650551 = 113 ⋅1607527.
It is a cyclic number.
It is not a de Polignac number, because 155056181 - 218 = 154794037 is a prime.
It is a super-3 number, since 3×1550561813 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155056481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11075435 + ... + 11075448.
It is an arithmetic number, because the mean of its divisors is an integer number (44301768).
Almost surely, 2155056181 is an apocalyptic number.
It is an amenable number.
155056181 is a deficient number, since it is larger than the sum of its proper divisors (22150891).
155056181 is an equidigital number, since it uses as much as digits as its factorization.
155056181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22150890.
The product of its (nonzero) digits is 6000, while the sum is 32.
The square root of 155056181 is about 12452.1556768296. The cubic root of 155056181 is about 537.2334280107.
The spelling of 155056181 in words is "one hundred fifty-five million, fifty-six thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •