Base | Representation |
---|---|
bin | 1110010011011… |
… | …10111110111000 |
3 | 22100210020102100 |
4 | 13021232332320 |
5 | 221204222443 |
6 | 15523503400 |
7 | 2654626425 |
oct | 711567670 |
9 | 270706370 |
10 | 119992248 |
11 | 61806a52 |
12 | 34227b60 |
13 | 1bb2353c |
14 | 11d16d4c |
15 | a8033d3 |
hex | 726efb8 |
119992248 has 24 divisors (see below), whose sum is σ = 324979200. Its totient is φ = 39997392.
The previous prime is 119992241. The next prime is 119992259. The reversal of 119992248 is 842299911.
It is a tau number, because it is divible by the number of its divisors (24).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119992241) 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 5 ways as a sum of consecutive naturals, for example, 833208 + ... + 833351.
It is an arithmetic number, because the mean of its divisors is an integer number (13540800).
Almost surely, 2119992248 is an apocalyptic number.
119992248 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
119992248 is an abundant number, since it is smaller than the sum of its proper divisors (204986952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119992248 is a wasteful number, since it uses less digits than its factorization.
119992248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666571 (or 1666564 counting only the distinct ones).
The product of its digits is 93312, while the sum is 45.
The square root of 119992248 is about 10954.0973156167. The cubic root of 119992248 is about 493.2317934840.
The spelling of 119992248 in words is "one hundred nineteen million, nine hundred ninety-two thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •