Base | Representation |
---|---|
bin | 100111000110… |
… | …101010110011 |
3 | 201021210122010 |
4 | 213012222303 |
5 | 10111012211 |
6 | 1003414003 |
7 | 153063045 |
oct | 47065263 |
9 | 21253563 |
10 | 10250931 |
11 | 5871749 |
12 | 3524303 |
13 | 217bb52 |
14 | 150ba95 |
15 | d774a6 |
hex | 9c6ab3 |
10250931 has 8 divisors (see below), whose sum is σ = 13821840. Its totient is φ = 6756992.
The previous prime is 10250923. The next prime is 10250941. The reversal of 10250931 is 13905201.
10250931 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10250931 - 23 = 10250923 is a prime.
It is a super-2 number, since 2×102509312 = 210163172733522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10250898 and 10250907.
It is not an unprimeable number, because it can be changed into a prime (10250941) 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 in 7 ways as a sum of consecutive naturals, for example, 18930 + ... + 19463.
It is an arithmetic number, because the mean of its divisors is an integer number (1727730).
Almost surely, 210250931 is an apocalyptic number.
10250931 is a deficient number, since it is larger than the sum of its proper divisors (3570909).
10250931 is an equidigital number, since it uses as much as digits as its factorization.
10250931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38485.
The product of its (nonzero) digits is 270, while the sum is 21.
The square root of 10250931 is about 3201.7075131873. The cubic root of 10250931 is about 217.2306508572.
The spelling of 10250931 in words is "ten million, two hundred fifty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •