Base | Representation |
---|---|
bin | 100111001010… |
… | …001001110000 |
3 | 201022112012121 |
4 | 213022021300 |
5 | 10111441300 |
6 | 1004004024 |
7 | 153152461 |
oct | 47121160 |
9 | 21275177 |
10 | 10265200 |
11 | 5881440 |
12 | 3530614 |
13 | 21854aa |
14 | 1512d68 |
15 | d7b81a |
hex | 9ca270 |
10265200 has 60 divisors (see below), whose sum is σ = 26915688. Its totient is φ = 3731200.
The previous prime is 10265197. The next prime is 10265207. The reversal of 10265200 is 256201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10265207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3234 + ... + 5566.
Almost surely, 210265200 is an apocalyptic number.
10265200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10265200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13457844).
10265200 is an abundant number, since it is smaller than the sum of its proper divisors (16650488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10265200 is a wasteful number, since it uses less digits than its factorization.
10265200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2362 (or 2351 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 10265200 is about 3203.9350804909. The cubic root of 10265200 is about 217.3313970579.
It can be divided in two parts, 1026 and 5200, that added together give a palindrome (6226).
The spelling of 10265200 in words is "ten million, two hundred sixty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •