Base | Representation |
---|---|
bin | 1110001110001… |
… | …11101000101101 |
3 | 22022111102011021 |
4 | 13013013220231 |
5 | 221020304142 |
6 | 15501054141 |
7 | 2646043141 |
oct | 707075055 |
9 | 268442137 |
10 | 119306797 |
11 | 61388a65 |
12 | 33b57351 |
13 | 1b94354c |
14 | 11bb9221 |
15 | a71a267 |
hex | 71c7a2d |
119306797 has 2 divisors, whose sum is σ = 119306798. Its totient is φ = 119306796.
The previous prime is 119306779. The next prime is 119306801. The reversal of 119306797 is 797603911.
Together with previous prime (119306779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95628841 + 23677956 = 9779^2 + 4866^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-119306797 is a prime.
It is a super-2 number, since 2×1193067972 = 28468223620798418, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (119306777) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59653398 + 59653399.
It is an arithmetic number, because the mean of its divisors is an integer number (59653399).
Almost surely, 2119306797 is an apocalyptic number.
It is an amenable number.
119306797 is a deficient number, since it is larger than the sum of its proper divisors (1).
119306797 is an equidigital number, since it uses as much as digits as its factorization.
119306797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 71442, while the sum is 43.
The square root of 119306797 is about 10922.7650803265. The cubic root of 119306797 is about 492.2908103492.
It can be divided in two parts, 119 and 306797, that added together give a square (306916 = 5542).
The spelling of 119306797 in words is "one hundred nineteen million, three hundred six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •