Base | Representation |
---|---|
bin | 110011000111… |
… | …0010100111100 |
3 | 1212102110002021 |
4 | 1212032110330 |
5 | 23330003442 |
6 | 2354205524 |
7 | 443526310 |
oct | 146162474 |
9 | 55373067 |
10 | 26797372 |
11 | 14143298 |
12 | 8b838a4 |
13 | 5723344 |
14 | 37b7b40 |
15 | 2544e67 |
hex | 198e53c |
26797372 has 48 divisors (see below), whose sum is σ = 59754240. Its totient is φ = 10236672.
The previous prime is 26797357. The next prime is 26797373. The reversal of 26797372 is 27379762.
It is a super-2 number, since 2×267973722 = 1436198292212768, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26797373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7563 + ... + 10525.
It is an arithmetic number, because the mean of its divisors is an integer number (1244880).
Almost surely, 226797372 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 26797372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29877120).
26797372 is an abundant number, since it is smaller than the sum of its proper divisors (32956868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26797372 is a wasteful number, since it uses less digits than its factorization.
26797372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3010 (or 3008 counting only the distinct ones).
The product of its digits is 222264, while the sum is 43.
The square root of 26797372 is about 5176.6178147512. The cubic root of 26797372 is about 299.2476406881.
The spelling of 26797372 in words is "twenty-six million, seven hundred ninety-seven thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •