Base | Representation |
---|---|
bin | 1110001110010… |
… | …10101000100101 |
3 | 22022112001000002 |
4 | 13013022220211 |
5 | 221021202302 |
6 | 15501231045 |
7 | 2646124013 |
oct | 707125045 |
9 | 268461002 |
10 | 119319077 |
11 | 61397209 |
12 | 33b62485 |
13 | 1b949007 |
14 | 11bbd8b3 |
15 | a71dc02 |
hex | 71caa25 |
119319077 has 8 divisors (see below), whose sum is σ = 121029120. Its totient is φ = 117619600.
The previous prime is 119319047. The next prime is 119319089. The reversal of 119319077 is 770913911.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 119319077 - 214 = 119302693 is a prime.
It is a super-2 number, since 2×1193190772 = 28474084272263858, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 119319077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119319047) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 21668 + ... + 26610.
It is an arithmetic number, because the mean of its divisors is an integer number (15128640).
Almost surely, 2119319077 is an apocalyptic number.
It is an amenable number.
119319077 is a deficient number, since it is larger than the sum of its proper divisors (1710043).
119319077 is a wasteful number, since it uses less digits than its factorization.
119319077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5283.
The product of its (nonzero) digits is 11907, while the sum is 38.
The square root of 119319077 is about 10923.3271945868. The cubic root of 119319077 is about 492.3076999255.
The spelling of 119319077 in words is "one hundred nineteen million, three hundred nineteen thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •