Base | Representation |
---|---|
bin | 110010001000… |
… | …1010100110100 |
3 | 1211110102202000 |
4 | 1210101110310 |
5 | 23212112424 |
6 | 2335215300 |
7 | 436264500 |
oct | 144212464 |
9 | 54412660 |
10 | 26285364 |
11 | 13923646 |
12 | 8977530 |
13 | 55a4291 |
14 | 36c3300 |
15 | 24933c9 |
hex | 1911534 |
26285364 has 72 divisors (see below), whose sum is σ = 79289280. Its totient is φ = 7508592.
The previous prime is 26285333. The next prime is 26285381. The reversal of 26285364 is 46358262.
It is a super-2 number, since 2×262853642 = 1381840721224992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2809 + ... + 7775.
It is an arithmetic number, because the mean of its divisors is an integer number (1101240).
Almost surely, 226285364 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26285364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39644640).
26285364 is an abundant number, since it is smaller than the sum of its proper divisors (53003916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26285364 is a wasteful number, since it uses less digits than its factorization.
26285364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4994 (or 4979 counting only the distinct ones).
The product of its digits is 69120, while the sum is 36.
The square root of 26285364 is about 5126.9253944250. The cubic root of 26285364 is about 297.3294986111.
It can be divided in two parts, 26 and 285364, that added together give a triangular number (285390 = T755).
The spelling of 26285364 in words is "twenty-six million, two hundred eighty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •