Base | Representation |
---|---|
bin | 1000101101000010000… |
… | …0101100111011101001 |
3 | 112021221210122210201021 |
4 | 2023100200230323221 |
5 | 4422212420343031 |
6 | 152405233052441 |
7 | 13542264364102 |
oct | 2132040547351 |
9 | 467853583637 |
10 | 149527121641 |
11 | 58461186697 |
12 | 24b903b7121 |
13 | 1113c602191 |
14 | 7346a593a9 |
15 | 3d52322511 |
hex | 22d082cee9 |
149527121641 has 2 divisors, whose sum is σ = 149527121642. Its totient is φ = 149527121640.
The previous prime is 149527121617. The next prime is 149527121719. The reversal of 149527121641 is 146121725941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119165801616 + 30361320025 = 345204^2 + 174245^2 .
It is a cyclic number.
It is not a de Polignac number, because 149527121641 - 29 = 149527121129 is a prime.
It is not a weakly prime, because it can be changed into another prime (149527121041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74763560820 + 74763560821.
It is an arithmetic number, because the mean of its divisors is an integer number (74763560821).
Almost surely, 2149527121641 is an apocalyptic number.
It is an amenable number.
149527121641 is a deficient number, since it is larger than the sum of its proper divisors (1).
149527121641 is an equidigital number, since it uses as much as digits as its factorization.
149527121641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 120960, while the sum is 43.
The spelling of 149527121641 in words is "one hundred forty-nine billion, five hundred twenty-seven million, one hundred twenty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •