Base | Representation |
---|---|
bin | 1100011011001000111101001… |
… | …0111000101111101101110101 |
3 | 11020122111222100021102221011012 |
4 | 3012302033102320233231311 |
5 | 1404042431430120400044 |
6 | 12335224024054322005 |
7 | 352102414504340216 |
oct | 30662172270575565 |
9 | 4218458307387135 |
10 | 874265606028149 |
11 | 233627a63600155 |
12 | 8207a646659305 |
13 | 2b6a9b7b90249a |
14 | 115c6976d6540d |
15 | 6b119c4b4a59e |
hex | 31b23d2e2fb75 |
874265606028149 has 2 divisors, whose sum is σ = 874265606028150. Its totient is φ = 874265606028148.
The previous prime is 874265606028053. The next prime is 874265606028169. The reversal of 874265606028149 is 941820606562478.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 632286363543025 + 241979242485124 = 25145305^2 + 15555682^2 .
It is a cyclic number.
It is not a de Polignac number, because 874265606028149 - 28 = 874265606027893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (874265606028169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 437132803014074 + 437132803014075.
It is an arithmetic number, because the mean of its divisors is an integer number (437132803014075).
Almost surely, 2874265606028149 is an apocalyptic number.
It is an amenable number.
874265606028149 is a deficient number, since it is larger than the sum of its proper divisors (1).
874265606028149 is an equidigital number, since it uses as much as digits as its factorization.
874265606028149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 278691840, while the sum is 68.
The spelling of 874265606028149 in words is "eight hundred seventy-four trillion, two hundred sixty-five billion, six hundred six million, twenty-eight thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •