Base | Representation |
---|---|
bin | 110011000011010… |
… | …000100101011101 |
3 | 2012200122022200001 |
4 | 303003100211131 |
5 | 3223230224011 |
6 | 220553334301 |
7 | 30140031223 |
oct | 6303204535 |
9 | 2180568601 |
10 | 856492381 |
11 | 3aa516448 |
12 | 1baa07391 |
13 | 1085a2434 |
14 | 81a72b13 |
15 | 502d57c1 |
hex | 330d095d |
856492381 has 2 divisors, whose sum is σ = 856492382. Its totient is φ = 856492380.
The previous prime is 856492367. The next prime is 856492387. The reversal of 856492381 is 183294658.
856492381 = T23894 + T23895 + T23896.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 837176356 + 19316025 = 28934^2 + 4395^2 .
It is a cyclic number.
It is not a de Polignac number, because 856492381 - 27 = 856492253 is a prime.
It is a super-2 number, since 2×8564923812 = 1467158397422098322, which contains 22 as substring.
It is equal to p43897537 and since 856492381 and 43897537 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (856492387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 428246190 + 428246191.
It is an arithmetic number, because the mean of its divisors is an integer number (428246191).
Almost surely, 2856492381 is an apocalyptic number.
856492381 is the 23896-th centered triangular number.
It is an amenable number.
856492381 is a deficient number, since it is larger than the sum of its proper divisors (1).
856492381 is an equidigital number, since it uses as much as digits as its factorization.
856492381 is an evil number, because the sum of its binary digits is even.
The product of its digits is 414720, while the sum is 46.
The square root of 856492381 is about 29265.8910850157. The cubic root of 856492381 is about 949.6738976761.
The spelling of 856492381 in words is "eight hundred fifty-six million, four hundred ninety-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •