Base | Representation |
---|---|
bin | 1110001110010… |
… | …01100010101001 |
3 | 22022111210212022 |
4 | 13013021202221 |
5 | 221021031401 |
6 | 15501154225 |
7 | 2646104660 |
oct | 707114251 |
9 | 268453768 |
10 | 119314601 |
11 | 6139390a |
12 | 33b5b975 |
13 | 1b946c73 |
14 | 11bbbdd7 |
15 | a71c71b |
hex | 71c98a9 |
119314601 has 4 divisors (see below), whose sum is σ = 136359552. Its totient is φ = 102269652.
The previous prime is 119314549. The next prime is 119314627. The reversal of 119314601 is 106413911.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 106413911 = 4327 ⋅24593.
It is a cyclic number.
It is not a de Polignac number, because 119314601 - 210 = 119313577 is a prime.
It is not an unprimeable number, because it can be changed into a prime (119314301) 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 3 ways as a sum of consecutive naturals, for example, 8522465 + ... + 8522478.
It is an arithmetic number, because the mean of its divisors is an integer number (34089888).
Almost surely, 2119314601 is an apocalyptic number.
It is an amenable number.
119314601 is a deficient number, since it is larger than the sum of its proper divisors (17044951).
119314601 is an equidigital number, since it uses as much as digits as its factorization.
119314601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17044950.
The product of its (nonzero) digits is 648, while the sum is 26.
The square root of 119314601 is about 10923.1223100357. The cubic root of 119314601 is about 492.3015438917.
The spelling of 119314601 in words is "one hundred nineteen million, three hundred fourteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •