Base | Representation |
---|---|
bin | 100110111000101… |
… | …0010010000100000 |
3 | 10100221010221202010 |
4 | 1031301102100200 |
5 | 10133004443342 |
6 | 333245352520 |
7 | 44222215653 |
oct | 11561222040 |
9 | 3327127663 |
10 | 1304765472 |
11 | 60a56267a |
12 | 304b68740 |
13 | 17a41609a |
14 | c540189a |
15 | 7983229c |
hex | 4dc52420 |
1304765472 has 24 divisors (see below), whose sum is σ = 3425009616. Its totient is φ = 434921792.
The previous prime is 1304765431. The next prime is 1304765491. The reversal of 1304765472 is 2745674031.
It is a tau number, because it is divible by the number of its divisors (24).
It is a self number, because there is not a number n which added to its sum of digits gives 1304765472.
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 3 ways as a sum of consecutive naturals, for example, 6795558 + ... + 6795749.
It is an arithmetic number, because the mean of its divisors is an integer number (142708734).
Almost surely, 21304765472 is an apocalyptic number.
1304765472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1304765472 is an abundant number, since it is smaller than the sum of its proper divisors (2120244144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304765472 is a wasteful number, since it uses less digits than its factorization.
1304765472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13591320 (or 13591312 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
The square root of 1304765472 is about 36121.5375088049. The cubic root of 1304765472 is about 1092.7248471506.
The spelling of 1304765472 in words is "one billion, three hundred four million, seven hundred sixty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •