Base | Representation |
---|---|
bin | 1100010000101… |
… | …11101000111001 |
3 | 21011112200122122 |
4 | 12020113220321 |
5 | 202312413043 |
6 | 14112331025 |
7 | 2356162301 |
oct | 610275071 |
9 | 234480578 |
10 | 102857273 |
11 | 53073212 |
12 | 2a543a75 |
13 | 184041bc |
14 | d936601 |
15 | 906b368 |
hex | 6217a39 |
102857273 has 2 divisors, whose sum is σ = 102857274. Its totient is φ = 102857272.
The previous prime is 102857263. The next prime is 102857347. The reversal of 102857273 is 372758201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99940009 + 2917264 = 9997^2 + 1708^2 .
It is a cyclic number.
It is not a de Polignac number, because 102857273 - 220 = 101808697 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p5916572 and since 102857273 and 5916572 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (102857213) 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, 51428636 + 51428637.
It is an arithmetic number, because the mean of its divisors is an integer number (51428637).
Almost surely, 2102857273 is an apocalyptic number.
It is an amenable number.
102857273 is a deficient number, since it is larger than the sum of its proper divisors (1).
102857273 is an equidigital number, since it uses as much as digits as its factorization.
102857273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23520, while the sum is 35.
The square root of 102857273 is about 10141.8574728696. The cubic root of 102857273 is about 468.5381969816.
It can be divided in two parts, 102 and 857273, that added together give a cube (857375 = 953).
The spelling of 102857273 in words is "one hundred two million, eight hundred fifty-seven thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •