Base | Representation |
---|---|
bin | 10010011111010… |
… | …11001100101001 |
3 | 101210212002202010 |
4 | 21033223030221 |
5 | 304201312131 |
6 | 23220230133 |
7 | 3562235241 |
oct | 1117531451 |
9 | 353762663 |
10 | 155104041 |
11 | 7a608a64 |
12 | 43b3b349 |
13 | 26198151 |
14 | 16856b21 |
15 | d93bb46 |
hex | 93eb329 |
155104041 has 4 divisors (see below), whose sum is σ = 206805392. Its totient is φ = 103402692.
The previous prime is 155104021. The next prime is 155104043. The reversal of 155104041 is 140401551.
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.
It is not a de Polignac number, because 155104041 - 210 = 155103017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155103999 and 155104017.
It is not an unprimeable number, because it can be changed into a prime (155104043) 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, 25850671 + ... + 25850676.
It is an arithmetic number, because the mean of its divisors is an integer number (51701348).
Almost surely, 2155104041 is an apocalyptic number.
It is an amenable number.
155104041 is a deficient number, since it is larger than the sum of its proper divisors (51701351).
155104041 is an equidigital number, since it uses as much as digits as its factorization.
155104041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51701350.
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 155104041 is about 12454.0772841668. The cubic root of 155104041 is about 537.2886968961.
Adding to 155104041 its reverse (140401551), we get a palindrome (295505592).
It can be divided in two parts, 155 and 104041, that added together give a triangular number (104196 = T456).
The spelling of 155104041 in words is "one hundred fifty-five million, one hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •