Base | Representation |
---|---|
bin | 110001111111… |
… | …1101100100101 |
3 | 1211022202200200 |
4 | 1203333230211 |
5 | 23202310112 |
6 | 2333501113 |
7 | 435544125 |
oct | 143775445 |
9 | 54282620 |
10 | 26213157 |
11 | 13884373 |
12 | 8941799 |
13 | 557a459 |
14 | 36a4c85 |
15 | 247bcdc |
hex | 18ffb25 |
26213157 has 6 divisors (see below), whose sum is σ = 37863462. Its totient is φ = 17475432.
The previous prime is 26213153. The next prime is 26213189. The reversal of 26213157 is 75131262.
It is a happy number.
26213157 is a `hidden beast` number, since 2 + 621 + 31 + 5 + 7 = 666.
It can be written as a sum of positive squares in only one way, i.e., 22268961 + 3944196 = 4719^2 + 1986^2 .
It is not a de Polignac number, because 26213157 - 22 = 26213153 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 26213157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26213153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1456278 + ... + 1456295.
It is an arithmetic number, because the mean of its divisors is an integer number (6310577).
Almost surely, 226213157 is an apocalyptic number.
It is an amenable number.
26213157 is a deficient number, since it is larger than the sum of its proper divisors (11650305).
26213157 is a wasteful number, since it uses less digits than its factorization.
26213157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2912579 (or 2912576 counting only the distinct ones).
The product of its digits is 2520, while the sum is 27.
The square root of 26213157 is about 5119.8786118423. The cubic root of 26213157 is about 297.0569900500.
It can be divided in two parts, 2621 and 3157, that added together give a triangular number (5778 = T107).
The spelling of 26213157 in words is "twenty-six million, two hundred thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •