Base | Representation |
---|---|
bin | 11010111101110… |
… | …11011001110000 |
3 | 120202122201202111 |
4 | 31132323121300 |
5 | 430402231230 |
6 | 34240255104 |
7 | 5414523400 |
oct | 1536733160 |
9 | 522581674 |
10 | 226211440 |
11 | 106766004 |
12 | 63911494 |
13 | 37b33a30 |
14 | 22086800 |
15 | 14cd592a |
hex | d7bb670 |
226211440 has 240 divisors, whose sum is σ = 691080768. Its totient is φ = 68124672.
The previous prime is 226211431. The next prime is 226211443. The reversal of 226211440 is 44112622.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226211443) by changing a digit.
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, 1171984 + ... + 1172176.
Almost surely, 2226211440 is an apocalyptic number.
226211440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 226211440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (345540384).
226211440 is an abundant number, since it is smaller than the sum of its proper divisors (464869328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226211440 is a wasteful number, since it uses less digits than its factorization.
226211440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256 (or 243 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 226211440 is about 15040.3271241021. The cubic root of 226211440 is about 609.3098348550.
The spelling of 226211440 in words is "two hundred twenty-six million, two hundred eleven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •