Base | Representation |
---|---|
bin | 110011000101000… |
… | …101010010000001 |
3 | 2012201112121100022 |
4 | 303011011102001 |
5 | 3223341022434 |
6 | 221011503225 |
7 | 30144061613 |
oct | 6305052201 |
9 | 2181477308 |
10 | 856970369 |
11 | 3aa812582 |
12 | 1babb7b15 |
13 | 10870bb78 |
14 | 81b58db3 |
15 | 5037c22e |
hex | 33145481 |
856970369 has 2 divisors, whose sum is σ = 856970370. Its totient is φ = 856970368.
The previous prime is 856970351. The next prime is 856970377. The reversal of 856970369 is 963079658.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 766625344 + 90345025 = 27688^2 + 9505^2 .
It is a cyclic number.
It is not a de Polignac number, because 856970369 - 28 = 856970113 is a prime.
It is a super-2 number, since 2×8569703692 = 1468796426687992322, which contains 22 as substring.
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 856970369.
It is not a weakly prime, because it can be changed into another prime (856970399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 428485184 + 428485185.
It is an arithmetic number, because the mean of its divisors is an integer number (428485185).
Almost surely, 2856970369 is an apocalyptic number.
It is an amenable number.
856970369 is a deficient number, since it is larger than the sum of its proper divisors (1).
856970369 is an equidigital number, since it uses as much as digits as its factorization.
856970369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 53.
The square root of 856970369 is about 29274.0562443950. The cubic root of 856970369 is about 949.8505282841.
The spelling of 856970369 in words is "eight hundred fifty-six million, nine hundred seventy thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •