Base | Representation |
---|---|
bin | 101000001101110… |
… | …0101010010000000 |
3 | 10111001011000121100 |
4 | 1100123211102000 |
5 | 10230422022442 |
6 | 341522254400 |
7 | 45303530511 |
oct | 12033452200 |
9 | 3431130540 |
10 | 1349407872 |
11 | 63278411a |
12 | 317ab7400 |
13 | 1867469c7 |
14 | cb302a08 |
15 | 7d6ee84c |
hex | 506e5480 |
1349407872 has 96 divisors (see below), whose sum is σ = 3941243280. Its totient is φ = 443063808.
The previous prime is 1349407853. The next prime is 1349407951. The reversal of 1349407872 is 2787049431.
It is a tau number, because it is divible by the number of its divisors (96).
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, 68443 + ... + 85925.
Almost surely, 21349407872 is an apocalyptic number.
1349407872 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 1349407872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1970621640).
1349407872 is an abundant number, since it is smaller than the sum of its proper divisors (2591835408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1349407872 is a wasteful number, since it uses less digits than its factorization.
1349407872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17570 (or 17555 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The square root of 1349407872 is about 36734.2874165268. The cubic root of 1349407872 is about 1105.0478394281.
The spelling of 1349407872 in words is "one billion, three hundred forty-nine million, four hundred seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •