Base | Representation |
---|---|
bin | 101001011001… |
… | …001100000000 |
3 | 202102021212120 |
4 | 221121030000 |
5 | 10234213242 |
6 | 1024324240 |
7 | 161142531 |
oct | 51311400 |
9 | 22367776 |
10 | 10851072 |
11 | 6141631 |
12 | 3773680 |
13 | 232c06b |
14 | 1626688 |
15 | e451ec |
hex | a59300 |
10851072 has 72 divisors (see below), whose sum is σ = 29433600. Its totient is φ = 3548160.
The previous prime is 10851047. The next prime is 10851077. The reversal of 10851072 is 27015801.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10851077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54429 + ... + 54627.
It is an arithmetic number, because the mean of its divisors is an integer number (408800).
Almost surely, 210851072 is an apocalyptic number.
10851072 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 10851072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14716800).
10851072 is an abundant number, since it is smaller than the sum of its proper divisors (18582528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10851072 is an equidigital number, since it uses as much as digits as its factorization.
10851072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289 (or 275 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 24.
The square root of 10851072 is about 3294.0965377475. The cubic root of 10851072 is about 221.3897696442.
Adding to 10851072 its reverse (27015801), we get a palindrome (37866873).
The spelling of 10851072 in words is "ten million, eight hundred fifty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •