Base | Representation |
---|---|
bin | 10110111011110… |
… | …110111001111101 |
3 | 222211001100211201 |
4 | 112323312321331 |
5 | 1242001241031 |
6 | 102103215501 |
7 | 12351443101 |
oct | 2673667175 |
9 | 884040751 |
10 | 384790141 |
11 | 18822758a |
12 | a8a47591 |
13 | 61947598 |
14 | 39165901 |
15 | 23babd61 |
hex | 16ef6e7d |
384790141 has 2 divisors, whose sum is σ = 384790142. Its totient is φ = 384790140.
The previous prime is 384790117. The next prime is 384790151. The reversal of 384790141 is 141097483.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 350812900 + 33977241 = 18730^2 + 5829^2 .
It is an emirp because it is prime and its reverse (141097483) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 384790141 - 211 = 384788093 is a prime.
It is a super-2 number, since 2×3847901412 = 296126905221599762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 384790141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (384790151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 192395070 + 192395071.
It is an arithmetic number, because the mean of its divisors is an integer number (192395071).
Almost surely, 2384790141 is an apocalyptic number.
It is an amenable number.
384790141 is a deficient number, since it is larger than the sum of its proper divisors (1).
384790141 is an equidigital number, since it uses as much as digits as its factorization.
384790141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 384790141 is about 19616.0684389100. The cubic root of 384790141 is about 727.3464308216.
The spelling of 384790141 in words is "three hundred eighty-four million, seven hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •