Base | Representation |
---|---|
bin | 10010100010110… |
… | …11100001100111 |
3 | 101211201110212122 |
4 | 21101123201213 |
5 | 304311023020 |
6 | 23234140155 |
7 | 3566162516 |
oct | 1121334147 |
9 | 354643778 |
10 | 155564135 |
11 | 7a8a2701 |
12 | 4412165b |
13 | 262c96ac |
14 | 1693667d |
15 | d9cd125 |
hex | 945b867 |
155564135 has 4 divisors (see below), whose sum is σ = 186676968. Its totient is φ = 124451304.
The previous prime is 155564119. The next prime is 155564137. The reversal of 155564135 is 531465551.
155564135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 155564135 - 24 = 155564119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 155564095 and 155564104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155564137) 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, 15556409 + ... + 15556418.
It is an arithmetic number, because the mean of its divisors is an integer number (46669242).
Almost surely, 2155564135 is an apocalyptic number.
155564135 is a deficient number, since it is larger than the sum of its proper divisors (31112833).
155564135 is an equidigital number, since it uses as much as digits as its factorization.
155564135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31112832.
The product of its digits is 45000, while the sum is 35.
The square root of 155564135 is about 12472.5352274508. The cubic root of 155564135 is about 537.8194358655.
It can be divided in two parts, 15556 and 4135, that added together give a palindrome (19691).
The spelling of 155564135 in words is "one hundred fifty-five million, five hundred sixty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •