Base | Representation |
---|---|
bin | 10110110001001… |
… | …001001000111001 |
3 | 222121202122202101 |
4 | 112301021020321 |
5 | 1240241344431 |
6 | 101523103401 |
7 | 12315533635 |
oct | 2661111071 |
9 | 877678671 |
10 | 381981241 |
11 | 186689184 |
12 | a7b11b61 |
13 | 611a2c05 |
14 | 38a33dc5 |
15 | 23804961 |
hex | 16c49239 |
381981241 has 2 divisors, whose sum is σ = 381981242. Its totient is φ = 381981240.
The previous prime is 381981239. The next prime is 381981253. The reversal of 381981241 is 142189183.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 342102016 + 39879225 = 18496^2 + 6315^2 .
It is an emirp because it is prime and its reverse (142189183) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 381981241 - 21 = 381981239 is a prime.
Together with 381981239, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 381981241.
It is not a weakly prime, because it can be changed into another prime (381981221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 190990620 + 190990621.
It is an arithmetic number, because the mean of its divisors is an integer number (190990621).
Almost surely, 2381981241 is an apocalyptic number.
It is an amenable number.
381981241 is a deficient number, since it is larger than the sum of its proper divisors (1).
381981241 is an equidigital number, since it uses as much as digits as its factorization.
381981241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13824, while the sum is 37.
The square root of 381981241 is about 19544.3403828321. The cubic root of 381981241 is about 725.5722733299.
The spelling of 381981241 in words is "three hundred eighty-one million, nine hundred eighty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •