Base | Representation |
---|---|
bin | 10010100000011… |
… | …01101101100011 |
3 | 101211010021200001 |
4 | 21100031231203 |
5 | 304220323121 |
6 | 23223240431 |
7 | 3563364346 |
oct | 1120155543 |
9 | 354107601 |
10 | 155245411 |
11 | 7a6a51a2 |
12 | 43ba9117 |
13 | 262175b9 |
14 | 1689245d |
15 | d968991 |
hex | 940db63 |
155245411 has 8 divisors (see below), whose sum is σ = 165975264. Its totient is φ = 144693120.
The previous prime is 155245397. The next prime is 155245421. The reversal of 155245411 is 114542551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 155245411 - 25 = 155245379 is a prime.
It is a super-2 number, since 2×1552454112 = 48202275273117842, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 155245411.
It is not an unprimeable number, because it can be changed into a prime (155245421) 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 in 7 ways as a sum of consecutive naturals, for example, 42580 + ... + 46081.
It is an arithmetic number, because the mean of its divisors is an integer number (20746908).
Almost surely, 2155245411 is an apocalyptic number.
155245411 is a deficient number, since it is larger than the sum of its proper divisors (10729853).
155245411 is a wasteful number, since it uses less digits than its factorization.
155245411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88781.
The product of its digits is 4000, while the sum is 28.
The square root of 155245411 is about 12459.7516427897. The cubic root of 155245411 is about 537.4518850747.
Adding to 155245411 its reverse (114542551), we get a palindrome (269787962).
The spelling of 155245411 in words is "one hundred fifty-five million, two hundred forty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •