Base | Representation |
---|---|
bin | 10010100001111… |
… | …10011110001101 |
3 | 101211111102122011 |
4 | 21100332132031 |
5 | 304243221013 |
6 | 23231421221 |
7 | 3565155544 |
oct | 1120763615 |
9 | 354442564 |
10 | 155445133 |
11 | 7a821258 |
12 | 44084811 |
13 | 2628748c |
14 | 1690515b |
15 | d9a7c3d |
hex | 943e78d |
155445133 has 4 divisors (see below), whose sum is σ = 160805340. Its totient is φ = 150084928.
The previous prime is 155445091. The next prime is 155445151. The reversal of 155445133 is 331544551.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83229129 + 72216004 = 9123^2 + 8498^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155445133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155445095 and 155445104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155445163) 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, 2680060 + ... + 2680117.
It is an arithmetic number, because the mean of its divisors is an integer number (40201335).
Almost surely, 2155445133 is an apocalyptic number.
It is an amenable number.
155445133 is a deficient number, since it is larger than the sum of its proper divisors (5360207).
155445133 is an equidigital number, since it uses as much as digits as its factorization.
155445133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5360206.
The product of its digits is 18000, while the sum is 31.
The square root of 155445133 is about 12467.7637529751. The cubic root of 155445133 is about 537.6822621842.
Adding to 155445133 its reverse (331544551), we get a palindrome (486989684).
The spelling of 155445133 in words is "one hundred fifty-five million, four hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •