Base | Representation |
---|---|
bin | 101000000011100… |
… | …0010110110010000 |
3 | 10110200000111020220 |
4 | 1100013002312100 |
5 | 10223032231302 |
6 | 341211033040 |
7 | 45210005115 |
oct | 12007026620 |
9 | 3420014226 |
10 | 1344023952 |
11 | 62a7370a7 |
12 | 31613b780 |
13 | 1855b025b |
14 | ca70090c |
15 | 7ced94bc |
hex | 501c2d90 |
1344023952 has 120 divisors (see below), whose sum is σ = 3720991008. Its totient is φ = 417753600.
The previous prime is 1344023917. The next prime is 1344023959. The reversal of 1344023952 is 2593204431.
It is not an unprimeable number, because it can be changed into a prime (1344023959) 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, 1040427 + ... + 1041717.
Almost surely, 21344023952 is an apocalyptic number.
1344023952 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 1344023952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1860495504).
1344023952 is an abundant number, since it is smaller than the sum of its proper divisors (2376967056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1344023952 is a wasteful number, since it uses less digits than its factorization.
1344023952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389 (or 1360 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 1344023952 is about 36660.9322303730. The cubic root of 1344023952 is about 1103.5762262429.
The spelling of 1344023952 in words is "one billion, three hundred forty-four million, twenty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •