Base | Representation |
---|---|
bin | 100111001001… |
… | …010100110100 |
3 | 201022100120010 |
4 | 213021110310 |
5 | 10111334222 |
6 | 1003540220 |
7 | 153136551 |
oct | 47112464 |
9 | 21270503 |
10 | 10261812 |
11 | 5879940 |
12 | 352a670 |
13 | 2183aa2 |
14 | 1511a28 |
15 | d7a80c |
hex | 9c9534 |
10261812 has 72 divisors (see below), whose sum is σ = 27851040. Its totient is φ = 2915840.
The previous prime is 10261799. The next prime is 10261817. The reversal of 10261812 is 21816201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10261817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38014 + ... + 38282.
It is an arithmetic number, because the mean of its divisors is an integer number (386820).
Almost surely, 210261812 is an apocalyptic number.
10261812 is a gapful number since it is divisible by the number (12) 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 10261812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13925520).
10261812 is an abundant number, since it is smaller than the sum of its proper divisors (17589228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10261812 is a wasteful number, since it uses less digits than its factorization.
10261812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321 (or 302 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
The square root of 10261812 is about 3203.4063120372. The cubic root of 10261812 is about 217.3074845576.
The spelling of 10261812 in words is "ten million, two hundred sixty-one thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •