Base | Representation |
---|---|
bin | 1100010011110… |
… | …01001011111111 |
3 | 21012021222202002 |
4 | 12021321023333 |
5 | 202413204311 |
6 | 14125052515 |
7 | 2362445216 |
oct | 611711377 |
9 | 235258662 |
10 | 103256831 |
11 | 53316427 |
12 | 2a6b713b |
13 | 18514022 |
14 | d9dc07d |
15 | 90e993b |
hex | 62792ff |
103256831 has 2 divisors, whose sum is σ = 103256832. Its totient is φ = 103256830.
The previous prime is 103256789. The next prime is 103256833. The reversal of 103256831 is 138652301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103256831 - 222 = 99062527 is a prime.
It is a super-2 number, since 2×1032568312 = 21323946296325122, which contains 22 as substring.
Together with 103256833, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 103256794 and 103256803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103256833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51628415 + 51628416.
It is an arithmetic number, because the mean of its divisors is an integer number (51628416).
Almost surely, 2103256831 is an apocalyptic number.
103256831 is a deficient number, since it is larger than the sum of its proper divisors (1).
103256831 is an equidigital number, since it uses as much as digits as its factorization.
103256831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 103256831 is about 10161.5368424269. The cubic root of 103256831 is about 469.1441055137.
The spelling of 103256831 in words is "one hundred three million, two hundred fifty-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •