Base | Representation |
---|---|
bin | 101101100010… |
… | …0000111000110 |
3 | 1122220211011000 |
4 | 1123010013012 |
5 | 22102400232 |
6 | 2211354130 |
7 | 406623333 |
oct | 133040706 |
9 | 48824130 |
10 | 23871942 |
11 | 12525386 |
12 | 7bb2946 |
13 | 4c3a913 |
14 | 325598a |
15 | 216827c |
hex | 16c41c6 |
23871942 has 64 divisors (see below), whose sum is σ = 57024000. Its totient is φ = 7379424.
The previous prime is 23871937. The next prime is 23871971. The reversal of 23871942 is 24917832.
It is a super-2 number, since 2×238719422 = 1139739229702728, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23871897 and 23871906.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54159 + ... + 54597.
It is an arithmetic number, because the mean of its divisors is an integer number (891000).
Almost surely, 223871942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23871942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28512000).
23871942 is an abundant number, since it is smaller than the sum of its proper divisors (33152058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23871942 is a wasteful number, since it uses less digits than its factorization.
23871942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522 (or 516 counting only the distinct ones).
The product of its digits is 24192, while the sum is 36.
The square root of 23871942 is about 4885.8921396199. The cubic root of 23871942 is about 287.9359666668.
The spelling of 23871942 in words is "twenty-three million, eight hundred seventy-one thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •