Base | Representation |
---|---|
bin | 100110110111101… |
… | …1001111001100000 |
3 | 10100220012220111011 |
4 | 1031233121321200 |
5 | 10132343204410 |
6 | 333231030304 |
7 | 44215063450 |
oct | 11557317140 |
9 | 3326186434 |
10 | 1304272480 |
11 | 60a256245 |
12 | 30496b394 |
13 | 17a2a2884 |
14 | c5313d60 |
15 | 7978618a |
hex | 4dbd9e60 |
1304272480 has 96 divisors (see below), whose sum is σ = 3706940160. Its totient is φ = 423636480.
The previous prime is 1304272441. The next prime is 1304272481. The reversal of 1304272480 is 842724031.
It is a super-2 number, since 2×13042724802 = 3402253404170700800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304272481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9366 + ... + 51925.
It is an arithmetic number, because the mean of its divisors is an integer number (38613960).
Almost surely, 21304272480 is an apocalyptic number.
1304272480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1304272480 is an abundant number, since it is smaller than the sum of its proper divisors (2402667680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304272480 is a wasteful number, since it uses less digits than its factorization.
1304272480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61332 (or 61324 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 31.
The square root of 1304272480 is about 36114.7127913265. The cubic root of 1304272480 is about 1092.5872049250.
The spelling of 1304272480 in words is "one billion, three hundred four million, two hundred seventy-two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •