Base | Representation |
---|---|
bin | 100001111010101010111111… |
… | …000101000011011100111101 |
3 | 201120011021011222020200221012 |
4 | 201322222333011003130331 |
5 | 124022424334002310242 |
6 | 1245130322224245005 |
7 | 43263663503205326 |
oct | 4172527705033475 |
9 | 646137158220835 |
10 | 149167419963197 |
11 | 43590602867719 |
12 | 1489178b170765 |
13 | 6530572b53c6c |
14 | 28b9a5512344d |
15 | 123a2c0c78282 |
hex | 87aabf14373d |
149167419963197 has 2 divisors, whose sum is σ = 149167419963198. Its totient is φ = 149167419963196.
The previous prime is 149167419963179. The next prime is 149167419963203. The reversal of 149167419963197 is 791369914761941.
Together with previous prime (149167419963179) 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., 145914948384676 + 3252471578521 = 12079526^2 + 1803461^2 .
It is a cyclic number.
It is not a de Polignac number, because 149167419963197 - 28 = 149167419962941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149167419963127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74583709981598 + 74583709981599.
It is an arithmetic number, because the mean of its divisors is an integer number (74583709981599).
Almost surely, 2149167419963197 is an apocalyptic number.
It is an amenable number.
149167419963197 is a deficient number, since it is larger than the sum of its proper divisors (1).
149167419963197 is an equidigital number, since it uses as much as digits as its factorization.
149167419963197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 555532992, while the sum is 77.
The spelling of 149167419963197 in words is "one hundred forty-nine trillion, one hundred sixty-seven billion, four hundred nineteen million, nine hundred sixty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •