Base | Representation |
---|---|
bin | 101011101000… |
… | …100010110110 |
3 | 210112010100100 |
4 | 223220202312 |
5 | 10412011022 |
6 | 1045054530 |
7 | 166136463 |
oct | 53504266 |
9 | 23463310 |
10 | 11438262 |
11 | 6502810 |
12 | 39b7446 |
13 | 24a6404 |
14 | 173a66a |
15 | 100e1ac |
hex | ae88b6 |
11438262 has 48 divisors (see below), whose sum is σ = 27714960. Its totient is φ = 3379200.
The previous prime is 11438261. The next prime is 11438333. The reversal of 11438262 is 26283411.
11438262 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11438261) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7414 + ... + 8822.
It is an arithmetic number, because the mean of its divisors is an integer number (577395).
Almost surely, 211438262 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11438262, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13857480).
11438262 is an abundant number, since it is smaller than the sum of its proper divisors (16276698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11438262 is a wasteful number, since it uses less digits than its factorization.
11438262 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1469 (or 1466 counting only the distinct ones).
The product of its digits is 2304, while the sum is 27.
The square root of 11438262 is about 3382.0499700625. The cubic root of 11438262 is about 225.3132230184.
It can be divided in two parts, 1143826 and 2, that added together give a triangular number (1143828 = T1512).
The spelling of 11438262 in words is "eleven million, four hundred thirty-eight thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •