Base | Representation |
---|---|
bin | 10001110001001… |
… | …01010000001101 |
3 | 101101110112200111 |
4 | 20320211100031 |
5 | 301124103011 |
6 | 22442400021 |
7 | 3456623134 |
oct | 1070452015 |
9 | 341415614 |
10 | 149050381 |
11 | 77153837 |
12 | 41b00011 |
13 | 24b588bc |
14 | 15b1c91b |
15 | d143121 |
hex | 8e2540d |
149050381 has 2 divisors, whose sum is σ = 149050382. Its totient is φ = 149050380.
The previous prime is 149050379. The next prime is 149050409. The reversal of 149050381 is 183050941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112254025 + 36796356 = 10595^2 + 6066^2 .
It is a cyclic number.
It is not a de Polignac number, because 149050381 - 21 = 149050379 is a prime.
It is a super-2 number, since 2×1490503812 = 44432032152490322, which contains 22 as substring.
Together with 149050379, it forms a pair of twin primes.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149050331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74525190 + 74525191.
It is an arithmetic number, because the mean of its divisors is an integer number (74525191).
Almost surely, 2149050381 is an apocalyptic number.
It is an amenable number.
149050381 is a deficient number, since it is larger than the sum of its proper divisors (1).
149050381 is an equidigital number, since it uses as much as digits as its factorization.
149050381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 149050381 is about 12208.6191274853. The cubic root of 149050381 is about 530.2056648125.
The spelling of 149050381 in words is "one hundred forty-nine million, fifty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •