Base | Representation |
---|---|
bin | 11000011011010011000001… |
… | …000101011111100011001101 |
3 | 112002101002221000220222112002 |
4 | 120123103001011133203031 |
5 | 103040104003112401224 |
6 | 1020252103352522045 |
7 | 31425325545443351 |
oct | 3033230105374315 |
9 | 462332830828462 |
10 | 107428961450189 |
11 | 31259404087015 |
12 | 100705519b0325 |
13 | 47c367a25b082 |
14 | 1c75837751461 |
15 | c647192479ae |
hex | 61b4c115f8cd |
107428961450189 has 2 divisors, whose sum is σ = 107428961450190. Its totient is φ = 107428961450188.
The previous prime is 107428961450147. The next prime is 107428961450281. The reversal of 107428961450189 is 981054169824701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98707364484964 + 8721596965225 = 9935158^2 + 2953235^2 .
It is a cyclic number.
It is not a de Polignac number, because 107428961450189 - 28 = 107428961449933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107428961050189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53714480725094 + 53714480725095.
It is an arithmetic number, because the mean of its divisors is an integer number (53714480725095).
Almost surely, 2107428961450189 is an apocalyptic number.
It is an amenable number.
107428961450189 is a deficient number, since it is larger than the sum of its proper divisors (1).
107428961450189 is an equidigital number, since it uses as much as digits as its factorization.
107428961450189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34836480, while the sum is 65.
The spelling of 107428961450189 in words is "one hundred seven trillion, four hundred twenty-eight billion, nine hundred sixty-one million, four hundred fifty thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •