Base | Representation |
---|---|
bin | 10010011111110… |
… | …10010101011101 |
3 | 101210222020210120 |
4 | 21033322111131 |
5 | 304210303140 |
6 | 23221425153 |
7 | 3562614066 |
oct | 1117722535 |
9 | 353866716 |
10 | 155166045 |
11 | 7a650601 |
12 | 43b6b1b9 |
13 | 261ba438 |
14 | 1687156d |
15 | d9501d0 |
hex | 93fa55d |
155166045 has 8 divisors (see below), whose sum is σ = 248265696. Its totient is φ = 82755216.
The previous prime is 155166041. The next prime is 155166091. The reversal of 155166045 is 540661551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 155166045 - 22 = 155166041 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 155165997 and 155166015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155166041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5172187 + ... + 5172216.
It is an arithmetic number, because the mean of its divisors is an integer number (31033212).
Almost surely, 2155166045 is an apocalyptic number.
155166045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
155166045 is a deficient number, since it is larger than the sum of its proper divisors (93099651).
155166045 is a wasteful number, since it uses less digits than its factorization.
155166045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10344411.
The product of its (nonzero) digits is 18000, while the sum is 33.
The square root of 155166045 is about 12456.5663406896. The cubic root of 155166045 is about 537.3602824158.
The spelling of 155166045 in words is "one hundred fifty-five million, one hundred sixty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •