Base | Representation |
---|---|
bin | 1110010010111… |
… | …10000110000000 |
3 | 22100122201112021 |
4 | 13021132012000 |
5 | 221200014242 |
6 | 15522211224 |
7 | 2654220643 |
oct | 711360600 |
9 | 270581467 |
10 | 119923072 |
11 | 61769a85 |
12 | 341b3b14 |
13 | 1bacabc9 |
14 | 11cd9a5a |
15 | a7dcb67 |
hex | 725e180 |
119923072 has 32 divisors (see below), whose sum is σ = 242841600. Its totient is φ = 58974720.
The previous prime is 119923039. The next prime is 119923121. The reversal of 119923072 is 270329911.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (32).
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 3 ways as a sum of consecutive naturals, for example, 129 + ... + 15487.
It is an arithmetic number, because the mean of its divisors is an integer number (7588800).
Almost surely, 2119923072 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 119923072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121420800).
119923072 is an abundant number, since it is smaller than the sum of its proper divisors (122918528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119923072 is an equidigital number, since it uses as much as digits as its factorization.
119923072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15434 (or 15422 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 34.
The square root of 119923072 is about 10950.9393204419. The cubic root of 119923072 is about 493.1369919116.
The spelling of 119923072 in words is "one hundred nineteen million, nine hundred twenty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •