Base | Representation |
---|---|
bin | 10110101010000… |
… | …011001000011101 |
3 | 222111021011211212 |
4 | 112222003020131 |
5 | 1234302343004 |
6 | 101415154205 |
7 | 12263660216 |
oct | 2652031035 |
9 | 874234755 |
10 | 380121629 |
11 | 185629008 |
12 | a7375965 |
13 | 609a1654 |
14 | 386ac40d |
15 | 2358896e |
hex | 16a8321d |
380121629 has 2 divisors, whose sum is σ = 380121630. Its totient is φ = 380121628.
The previous prime is 380121617. The next prime is 380121653. The reversal of 380121629 is 926121083.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 282072025 + 98049604 = 16795^2 + 9902^2 .
It is a cyclic number.
It is not a de Polignac number, because 380121629 - 212 = 380117533 is a prime.
It is a super-2 number, since 2×3801216292 = 288984905667227282, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 380121595 and 380121604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (380121229) 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, 190060814 + 190060815.
It is an arithmetic number, because the mean of its divisors is an integer number (190060815).
Almost surely, 2380121629 is an apocalyptic number.
It is an amenable number.
380121629 is a deficient number, since it is larger than the sum of its proper divisors (1).
380121629 is an equidigital number, since it uses as much as digits as its factorization.
380121629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 380121629 is about 19496.7081580456. The cubic root of 380121629 is about 724.3929148616.
The spelling of 380121629 in words is "three hundred eighty million, one hundred twenty-one thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •