Base | Representation |
---|---|
bin | 1000001110010001011111 |
3 | 11001111221121 |
4 | 20032101133 |
5 | 1022434430 |
6 | 114111411 |
7 | 24215410 |
oct | 10162137 |
9 | 4044847 |
10 | 2155615 |
11 | 1242600 |
12 | 87b567 |
13 | 5a6217 |
14 | 401807 |
15 | 2c8a7a |
hex | 20e45f |
2155615 has 24 divisors (see below), whose sum is σ = 3255840. Its totient is φ = 1341120.
The previous prime is 2155613. The next prime is 2155627. The reversal of 2155615 is 5165512.
2155615 = T125 + T126 + ... + T245.
2155615 is nontrivially palindromic in base 6.
2155615 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2155615 - 21 = 2155613 is a prime.
It is a super-3 number, since 3×21556153 = 30049333639746700125, which contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2155615.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2155613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3981 + ... + 4489.
It is an arithmetic number, because the mean of its divisors is an integer number (135660).
22155615 is an apocalyptic number.
2155615 is a deficient number, since it is larger than the sum of its proper divisors (1100225).
2155615 is a wasteful number, since it uses less digits than its factorization.
2155615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543 (or 532 counting only the distinct ones).
The product of its digits is 1500, while the sum is 25.
The square root of 2155615 is about 1468.2012804789. The cubic root of 2155615 is about 129.1785481035.
The spelling of 2155615 in words is "two million, one hundred fifty-five thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •