Base | Representation |
---|---|
bin | 110010001100… |
… | …1100011111000 |
3 | 1211112011000100 |
4 | 1210121203320 |
5 | 23214202341 |
6 | 2340035400 |
7 | 436465026 |
oct | 144314370 |
9 | 54464010 |
10 | 26319096 |
11 | 13946a21 |
12 | 8992b60 |
13 | 55b673b |
14 | 36d1716 |
15 | 249d3b6 |
hex | 19198f8 |
26319096 has 48 divisors (see below), whose sum is σ = 72947160. Its totient is φ = 8568000.
The previous prime is 26319091. The next prime is 26319101. The reversal of 26319096 is 69091362.
It is an interprime number because it is at equal distance from previous prime (26319091) and next prime (26319101).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 26319096.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26319091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1155 + ... + 7346.
Almost surely, 226319096 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 26319096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36473580).
26319096 is an abundant number, since it is smaller than the sum of its proper divisors (46628064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26319096 is a wasteful number, since it uses less digits than its factorization.
26319096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8556 (or 8549 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 36.
The square root of 26319096 is about 5130.2140306229. The cubic root of 26319096 is about 297.4566318630.
The spelling of 26319096 in words is "twenty-six million, three hundred nineteen thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •