Base | Representation |
---|---|
bin | 101001000000111010000 |
3 | 2112021120000 |
4 | 11020013100 |
5 | 321001302 |
6 | 44450000 |
7 | 14265141 |
oct | 5100720 |
9 | 2467500 |
10 | 1343952 |
11 | 838805 |
12 | 549900 |
13 | 38094c |
14 | 26dac8 |
15 | 1b831c |
hex | 1481d0 |
1343952 has 100 divisors (see below), whose sum is σ = 4186116. Its totient is φ = 414720.
The previous prime is 1343941. The next prime is 1343957. The reversal of 1343952 is 2593431.
It can be written as a sum of positive squares in 2 ways, for example, as 467856 + 876096 = 684^2 + 936^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 22002 + ... + 22062.
21343952 is an apocalyptic number.
1343952 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 1343952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2093058).
1343952 is an abundant number, since it is smaller than the sum of its proper divisors (2842164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1343952 is a wasteful number, since it uses less digits than its factorization.
1343952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98 (or 83 counting only the distinct ones).
The product of its digits is 3240, while the sum is 27.
The square root of 1343952 is about 1159.2894375435. The cubic root of 1343952 is about 110.3556532662.
The spelling of 1343952 in words is "one million, three hundred forty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •