Base | Representation |
---|---|
bin | 1110001100011… |
… | …00011001001101 |
3 | 22022001002022000 |
4 | 13012030121031 |
5 | 220440023031 |
6 | 15451542513 |
7 | 2644012530 |
oct | 706143115 |
9 | 268032260 |
10 | 119064141 |
11 | 61232719 |
12 | 33a5aa39 |
13 | 1b889c71 |
14 | 11b54a17 |
15 | a6bd3e6 |
hex | 718c64d |
119064141 has 32 divisors (see below), whose sum is σ = 213454080. Its totient is φ = 64032768.
The previous prime is 119064133. The next prime is 119064157. The reversal of 119064141 is 141460911.
119064141 is a `hidden beast` number, since 1 + 19 + 0 + 641 + 4 + 1 = 666.
It is not a de Polignac number, because 119064141 - 23 = 119064133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119064161) 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 31 ways as a sum of consecutive naturals, for example, 15316 + ... + 21741.
It is an arithmetic number, because the mean of its divisors is an integer number (6670440).
Almost surely, 2119064141 is an apocalyptic number.
It is an amenable number.
119064141 is a deficient number, since it is larger than the sum of its proper divisors (94389939).
119064141 is a wasteful number, since it uses less digits than its factorization.
119064141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37090 (or 37084 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The square root of 119064141 is about 10911.6516165061. The cubic root of 119064141 is about 491.9568299421.
The spelling of 119064141 in words is "one hundred nineteen million, sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •