Base | Representation |
---|---|
bin | 100010100111… |
… | …0001101011110 |
3 | 1021010220211100 |
4 | 1011032031132 |
5 | 14121134032 |
6 | 1444533530 |
7 | 310145130 |
oct | 105161536 |
9 | 37126740 |
10 | 18146142 |
11 | a274513 |
12 | 60b12a6 |
13 | 39b4681 |
14 | 25a5050 |
15 | 18d697c |
hex | 114e35e |
18146142 has 48 divisors (see below), whose sum is σ = 45527040. Its totient is φ = 5116176.
The previous prime is 18146101. The next prime is 18146147. The reversal of 18146142 is 24164181.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18146147) 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 23 ways as a sum of consecutive naturals, for example, 9043 + ... + 10865.
It is an arithmetic number, because the mean of its divisors is an integer number (948480).
Almost surely, 218146142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 18146142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22763520).
18146142 is an abundant number, since it is smaller than the sum of its proper divisors (27380898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18146142 is a wasteful number, since it uses less digits than its factorization.
18146142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1917 (or 1914 counting only the distinct ones).
The product of its digits is 1536, while the sum is 27.
The square root of 18146142 is about 4259.8288698022. The cubic root of 18146142 is about 262.7814885177.
It can be divided in two parts, 181461 and 42, that added together give a triangular number (181503 = T602).
The spelling of 18146142 in words is "eighteen million, one hundred forty-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •