Base | Representation |
---|---|
bin | 100111011101… |
… | …011000010000 |
3 | 201110112020100 |
4 | 213131120100 |
5 | 10122001302 |
6 | 1005412400 |
7 | 153631203 |
oct | 47353020 |
9 | 21415210 |
10 | 10343952 |
11 | 5925623 |
12 | 356a100 |
13 | 21b22a8 |
14 | 153393a |
15 | d94d1c |
hex | 9dd610 |
10343952 has 60 divisors (see below), whose sum is σ = 29959020. Its totient is φ = 3327744.
The previous prime is 10343947. The next prime is 10344001. The reversal of 10343952 is 25934301.
It can be written as a sum of positive squares in 2 ways, for example, as 5308416 + 5035536 = 2304^2 + 2244^2 .
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2938 + ... + 5414.
It is an arithmetic number, because the mean of its divisors is an integer number (499317).
Almost surely, 210343952 is an apocalyptic number.
10343952 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 10343952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14979510).
10343952 is an abundant number, since it is smaller than the sum of its proper divisors (19615068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10343952 is a wasteful number, since it uses less digits than its factorization.
10343952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2520 (or 2511 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 10343952 is about 3216.2014862256. The cubic root of 10343952 is about 217.8857522173.
The spelling of 10343952 in words is "ten million, three hundred forty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •