Base | Representation |
---|---|
bin | 100110110111010… |
… | …1010000100000000 |
3 | 10100212211221201021 |
4 | 1031232222010000 |
5 | 10132320422134 |
6 | 333222515224 |
7 | 44213316301 |
oct | 11556520400 |
9 | 3325757637 |
10 | 1304076544 |
11 | 60a132011 |
12 | 304895b14 |
13 | 17a234634 |
14 | c52a27a8 |
15 | 797480b4 |
hex | 4dbaa100 |
1304076544 has 81 divisors (see below), whose sum is σ = 2719889991. Its totient is φ = 624015360.
The previous prime is 1304076503. The next prime is 1304076547. The reversal of 1304076544 is 4456704031.
The square root of 1304076544 is 36112.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 28729600 + 1275346944 = 5360^2 + 35712^2 .
It is a super-2 number, since 2×13040765442 = 3401231265221967872, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1304076547) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 21378274 + ... + 21378334.
Almost surely, 21304076544 is an apocalyptic number.
1304076544 is the 36112-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1304076544
1304076544 is an abundant number, since it is smaller than the sum of its proper divisors (1415813447).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304076544 is an frugal number, since it uses more digits than its factorization.
1304076544 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212 (or 100 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 34.
The cubic root of 1304076544 is about 1092.5324904154.
The spelling of 1304076544 in words is "one billion, three hundred four million, seventy-six thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •