Base | Representation |
---|---|
bin | 1011000100100110010… |
… | …00100001000010100001 |
3 | 1100100221111220002102122 |
4 | 11202103020201002201 |
5 | 22213102423332111 |
6 | 450433132554025 |
7 | 36325205201561 |
oct | 5422310410241 |
9 | 1310844802378 |
10 | 380425605281 |
11 | 137379377987 |
12 | 6188b922915 |
13 | 29b4919b867 |
14 | 145ac628da1 |
15 | 9d681eccdb |
hex | 58932210a1 |
380425605281 has 2 divisors, whose sum is σ = 380425605282. Its totient is φ = 380425605280.
The previous prime is 380425605229. The next prime is 380425605283. The reversal of 380425605281 is 182506524083.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 371709702400 + 8715902881 = 609680^2 + 93359^2 .
It is a cyclic number.
It is not a de Polignac number, because 380425605281 - 238 = 105547698337 is a prime.
It is a super-2 number, since 2×3804256052812 (a number of 24 digits) contains 22 as substring.
Together with 380425605283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (380425605283) 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, 190212802640 + 190212802641.
It is an arithmetic number, because the mean of its divisors is an integer number (190212802641).
Almost surely, 2380425605281 is an apocalyptic number.
It is an amenable number.
380425605281 is a deficient number, since it is larger than the sum of its proper divisors (1).
380425605281 is an equidigital number, since it uses as much as digits as its factorization.
380425605281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 460800, while the sum is 44.
The spelling of 380425605281 in words is "three hundred eighty billion, four hundred twenty-five million, six hundred five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •