Base | Representation |
---|---|
bin | 100110110101… |
… | …111101000100 |
3 | 201011022201110 |
4 | 212311331010 |
5 | 10101314333 |
6 | 1002125020 |
7 | 152356332 |
oct | 46657504 |
9 | 21138643 |
10 | 10182468 |
11 | 582526a |
12 | 34b0770 |
13 | 215693a |
14 | 14d0b52 |
15 | d62063 |
hex | 9b5f44 |
10182468 has 48 divisors (see below), whose sum is σ = 25159680. Its totient is φ = 3198624.
The previous prime is 10182463. The next prime is 10182493. The reversal of 10182468 is 86428101.
It is not an unprimeable number, because it can be changed into a prime (10182463) 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, 21571 + ... + 22037.
It is an arithmetic number, because the mean of its divisors is an integer number (524160).
Almost surely, 210182468 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 10182468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12579840).
10182468 is an abundant number, since it is smaller than the sum of its proper divisors (14977212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10182468 is a wasteful number, since it uses less digits than its factorization.
10182468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576 (or 574 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 30.
The square root of 10182468 is about 3190.9979630203. The cubic root of 10182468 is about 216.7459633485.
It can be divided in two parts, 1018 and 2468, that added together give a triangular number (3486 = T83).
The spelling of 10182468 in words is "ten million, one hundred eighty-two thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •