Base | Representation |
---|---|
bin | 10101111100110… |
… | …00100111110110 |
3 | 110211110120022100 |
4 | 22332120213312 |
5 | 334114012232 |
6 | 30134242530 |
7 | 4364021220 |
oct | 1276304766 |
9 | 424416270 |
10 | 184125942 |
11 | 94a30600 |
12 | 517b6446 |
13 | 2c1b9b80 |
14 | 1a64d410 |
15 | 11270c7c |
hex | af989f6 |
184125942 has 144 divisors (see below), whose sum is σ = 540277920. Its totient is φ = 44098560.
The previous prime is 184125923. The next prime is 184125943. The reversal of 184125942 is 249521481.
It is a junction number, because it is equal to n+sod(n) for n = 184125897 and 184125906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (184125943) 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 71 ways as a sum of consecutive naturals, for example, 197734 + ... + 198662.
It is an arithmetic number, because the mean of its divisors is an integer number (3751930).
Almost surely, 2184125942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 184125942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (270138960).
184125942 is an abundant number, since it is smaller than the sum of its proper divisors (356151978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
184125942 is a wasteful number, since it uses less digits than its factorization.
184125942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979 (or 965 counting only the distinct ones).
The product of its digits is 23040, while the sum is 36.
The square root of 184125942 is about 13569.3014558598. The cubic root of 184125942 is about 568.9031353216.
The spelling of 184125942 in words is "one hundred eighty-four million, one hundred twenty-five thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •