Base | Representation |
---|---|
bin | 10110101110011… |
… | …010000001000101 |
3 | 222120102012210201 |
4 | 112232122001011 |
5 | 1240100421231 |
6 | 101455450501 |
7 | 12306455452 |
oct | 2656320105 |
9 | 876365721 |
10 | 381263941 |
11 | 186239273 |
12 | a7826a31 |
13 | 60cb1586 |
14 | 388c8829 |
15 | 23712161 |
hex | 16b9a045 |
381263941 has 2 divisors, whose sum is σ = 381263942. Its totient is φ = 381263940.
The previous prime is 381263917. The next prime is 381263951. The reversal of 381263941 is 149362183.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 286591041 + 94672900 = 16929^2 + 9730^2 .
It is an emirp because it is prime and its reverse (149362183) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 381263941 - 211 = 381261893 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 381263941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (381263951) 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, 190631970 + 190631971.
It is an arithmetic number, because the mean of its divisors is an integer number (190631971).
Almost surely, 2381263941 is an apocalyptic number.
It is an amenable number.
381263941 is a deficient number, since it is larger than the sum of its proper divisors (1).
381263941 is an equidigital number, since it uses as much as digits as its factorization.
381263941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 37.
The square root of 381263941 is about 19525.9811789318. The cubic root of 381263941 is about 725.1178189815.
The spelling of 381263941 in words is "three hundred eighty-one million, two hundred sixty-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •