Base | Representation |
---|---|
bin | 1110010000101… |
… | …00011000010101 |
3 | 22100002101100122 |
4 | 13020110120111 |
5 | 221110334031 |
6 | 15511521325 |
7 | 2651522453 |
oct | 710243025 |
9 | 270071318 |
10 | 119621141 |
11 | 61583152 |
12 | 34089245 |
13 | 1ba23653 |
14 | 11c5b9d3 |
15 | a77d47b |
hex | 7214615 |
119621141 has 4 divisors (see below), whose sum is σ = 122403072. Its totient is φ = 116839212.
The previous prime is 119621119. The next prime is 119621153. The reversal of 119621141 is 141126911.
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.
It is a cyclic number.
It is not a de Polignac number, because 119621141 - 26 = 119621077 is a prime.
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 119621141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119621101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1390901 + ... + 1390986.
It is an arithmetic number, because the mean of its divisors is an integer number (30600768).
Almost surely, 2119621141 is an apocalyptic number.
It is an amenable number.
119621141 is a deficient number, since it is larger than the sum of its proper divisors (2781931).
119621141 is an equidigital number, since it uses as much as digits as its factorization.
119621141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2781930.
The product of its digits is 432, while the sum is 26.
The square root of 119621141 is about 10937.1450113821. The cubic root of 119621141 is about 492.7227861650.
The spelling of 119621141 in words is "one hundred nineteen million, six hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •