Base | Representation |
---|---|
bin | 100000100011100… |
… | …0011011100001110 |
3 | 2211010111001101100 |
4 | 1001013003130032 |
5 | 4214121240032 |
6 | 300221123530 |
7 | 36032655525 |
oct | 10107033416 |
9 | 2733431340 |
10 | 1092368142 |
11 | 510682398 |
12 | 2659b95a6 |
13 | 14540aca8 |
14 | a51134bc |
15 | 65d7997c |
hex | 411c370e |
1092368142 has 48 divisors (see below), whose sum is σ = 2453667840. Its totient is φ = 350859600.
The previous prime is 1092368077. The next prime is 1092368161. The reversal of 1092368142 is 2418632901.
It is a junction number, because it is equal to n+sod(n) for n = 1092368097 and 1092368106.
It is a congruent number.
It is an unprimeable number.
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, 129267 + ... + 137457.
It is an arithmetic number, because the mean of its divisors is an integer number (51118080).
Almost surely, 21092368142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1092368142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1226833920).
1092368142 is an abundant number, since it is smaller than the sum of its proper divisors (1361299698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1092368142 is a wasteful number, since it uses less digits than its factorization.
1092368142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8469 (or 8466 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 1092368142 is about 33050.9930561852. The cubic root of 1092368142 is about 1029.8872349606.
The spelling of 1092368142 in words is "one billion, ninety-two million, three hundred sixty-eight thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •