Base | Representation |
---|---|
bin | 101001110001… |
… | …010110100000 |
3 | 202121022122100 |
4 | 221301112200 |
5 | 10300400143 |
6 | 1030410400 |
7 | 162034224 |
oct | 51612640 |
9 | 22538570 |
10 | 10950048 |
11 | 61a9a2a |
12 | 3800a00 |
13 | 2365125 |
14 | 1650784 |
15 | e646d3 |
hex | a715a0 |
10950048 has 72 divisors (see below), whose sum is σ = 31459428. Its totient is φ = 3612672.
The previous prime is 10950007. The next prime is 10950053. The reversal of 10950048 is 84005901.
It can be written as a sum of positive squares in 2 ways, for example, as 10575504 + 374544 = 3252^2 + 612^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55486 + ... + 55682.
Almost surely, 210950048 is an apocalyptic number.
10950048 is a gapful number since it is divisible by the number (18) 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 10950048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15729714).
10950048 is an abundant number, since it is smaller than the sum of its proper divisors (20509380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10950048 is a wasteful number, since it uses less digits than its factorization.
10950048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 406 (or 395 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 10950048 is about 3309.0856743215. The cubic root of 10950048 is about 222.0608549993.
Adding to 10950048 its reverse (84005901), we get a palindrome (94955949).
The spelling of 10950048 in words is "ten million, nine hundred fifty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •