Base | Representation |
---|---|
bin | 101000000101… |
… | …011111011101 |
3 | 201202212121120 |
4 | 220011133131 |
5 | 10142231003 |
6 | 1013121153 |
7 | 155214210 |
oct | 50053735 |
9 | 21685546 |
10 | 10508253 |
11 | 5a28008 |
12 | 36291b9 |
13 | 223c002 |
14 | 1577777 |
15 | dc8853 |
hex | a057dd |
10508253 has 8 divisors (see below), whose sum is σ = 16012608. Its totient is φ = 6004704.
The previous prime is 10508243. The next prime is 10508269. The reversal of 10508253 is 35280501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10508253 - 25 = 10508221 is a prime.
It is a super-2 number, since 2×105082532 = 220846762224018, which contains 22 as substring.
It is a Curzon number.
It is a plaindrome in base 14.
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10508203) 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, 250176 + ... + 250217.
It is an arithmetic number, because the mean of its divisors is an integer number (2001576).
Almost surely, 210508253 is an apocalyptic number.
It is an amenable number.
10508253 is a deficient number, since it is larger than the sum of its proper divisors (5504355).
10508253 is an equidigital number, since it uses as much as digits as its factorization.
10508253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500403.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 10508253 is about 3241.6435646135. The cubic root of 10508253 is about 219.0333136703.
Adding to 10508253 its reverse (35280501), we get a palindrome (45788754).
The spelling of 10508253 in words is "ten million, five hundred eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •