Base | Representation |
---|---|
bin | 100111001101… |
… | …110110000101 |
3 | 201100021221210 |
4 | 213031312011 |
5 | 10112432300 |
6 | 1004202033 |
7 | 153244536 |
oct | 47156605 |
9 | 21307853 |
10 | 10280325 |
11 | 5891840 |
12 | 3539319 |
13 | 218c343 |
14 | 151868d |
15 | d81050 |
hex | 9cdd85 |
10280325 has 48 divisors (see below), whose sum is σ = 19659456. Its totient is φ = 4684800.
The previous prime is 10280323. The next prime is 10280341. The reversal of 10280325 is 52308201.
10280325 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10280325 - 21 = 10280323 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10280321) 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 47 ways as a sum of consecutive naturals, for example, 13659 + ... + 14391.
It is an arithmetic number, because the mean of its divisors is an integer number (409572).
Almost surely, 210280325 is an apocalyptic number.
10280325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10280325 is a deficient number, since it is larger than the sum of its proper divisors (9379131).
10280325 is a wasteful number, since it uses less digits than its factorization.
10280325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774 (or 769 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 10280325 is about 3206.2945903332. The cubic root of 10280325 is about 217.4380851643.
Adding to 10280325 its reverse (52308201), we get a palindrome (62588526).
The spelling of 10280325 in words is "ten million, two hundred eighty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •