Base | Representation |
---|---|
bin | 1110001101111… |
… | …10101000000001 |
3 | 22022102112112022 |
4 | 13012332220001 |
5 | 221013114024 |
6 | 15500211225 |
7 | 2645530424 |
oct | 706765001 |
9 | 268375468 |
10 | 119269889 |
11 | 61363262 |
12 | 33b39b15 |
13 | 1b92c7cb |
14 | 11ba99bb |
15 | a70e35e |
hex | 71bea01 |
119269889 has 2 divisors, whose sum is σ = 119269890. Its totient is φ = 119269888.
The previous prime is 119269883. The next prime is 119269901. The reversal of 119269889 is 988962911.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102171664 + 17098225 = 10108^2 + 4135^2 .
It is an emirp because it is prime and its reverse (988962911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 119269889 - 24 = 119269873 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 119269889.
It is not a weakly prime, because it can be changed into another prime (119269883) 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 as a sum of consecutive naturals, namely, 59634944 + 59634945.
It is an arithmetic number, because the mean of its divisors is an integer number (59634945).
Almost surely, 2119269889 is an apocalyptic number.
It is an amenable number.
119269889 is a deficient number, since it is larger than the sum of its proper divisors (1).
119269889 is an equidigital number, since it uses as much as digits as its factorization.
119269889 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 559872, while the sum is 53.
The square root of 119269889 is about 10921.0754507054. The cubic root of 119269889 is about 492.2400411178.
The spelling of 119269889 in words is "one hundred nineteen million, two hundred sixty-nine thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •