Base | Representation |
---|---|
bin | 110010111110… |
… | …0011101111110 |
3 | 1212021201202000 |
4 | 1211330131332 |
5 | 23320133342 |
6 | 2352443130 |
7 | 443103120 |
oct | 145743576 |
9 | 55251660 |
10 | 26724222 |
11 | 140a3338 |
12 | 8b494a6 |
13 | 56c8c65 |
14 | 3799210 |
15 | 252d44c |
hex | 197c77e |
26724222 has 96 divisors (see below), whose sum is σ = 72633600. Its totient is φ = 7115040.
The previous prime is 26724209. The next prime is 26724233. The reversal of 26724222 is 22242762.
26724222 is nontrivially palindromic in base 13.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 438072 + ... + 438132.
It is an arithmetic number, because the mean of its divisors is an integer number (756600).
Almost surely, 226724222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26724222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36316800).
26724222 is an abundant number, since it is smaller than the sum of its proper divisors (45909378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26724222 is a wasteful number, since it uses less digits than its factorization.
26724222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159 (or 92 counting only the distinct ones).
The product of its digits is 5376, while the sum is 27.
The square root of 26724222 is about 5169.5475624081. The cubic root of 26724222 is about 298.9751026051.
Adding to 26724222 its reverse (22242762), we get a palindrome (48966984).
The spelling of 26724222 in words is "twenty-six million, seven hundred twenty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •