Base | Representation |
---|---|
bin | 1110010011000… |
… | …10000000000000 |
3 | 22100200112110212 |
4 | 13021202000000 |
5 | 221201022242 |
6 | 15522413252 |
7 | 2654315411 |
oct | 711420000 |
9 | 270615425 |
10 | 119939072 |
11 | 61780000 |
12 | 34201228 |
13 | 1bb05286 |
14 | 11d01808 |
15 | a7e2782 |
hex | 7262000 |
119939072 has 70 divisors (see below), whose sum is σ = 263848215. Its totient is φ = 54517760.
The previous prime is 119939059. The next prime is 119939087. The reversal of 119939072 is 270939911.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 59969536 + 59969536 = 7744^2 + 7744^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=7744.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 4 ways as a sum of consecutive naturals, for example, 10903547 + ... + 10903557.
Almost surely, 2119939072 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 119939072
119939072 is an abundant number, since it is smaller than the sum of its proper divisors (143909143).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119939072 is an frugal number, since it uses more digits than its factorization.
119939072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70 (or 13 counting only the distinct ones).
The product of its (nonzero) digits is 30618, while the sum is 41.
The square root of 119939072 is about 10951.6698270172. The cubic root of 119939072 is about 493.1589221953.
The spelling of 119939072 in words is "one hundred nineteen million, nine hundred thirty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •