Base | Representation |
---|---|
bin | 100110111000100… |
… | …0010110000101000 |
3 | 10100221000201200000 |
4 | 1031301002300220 |
5 | 10133000430432 |
6 | 333244143000 |
7 | 44221532616 |
oct | 11561026050 |
9 | 3327021600 |
10 | 1304701992 |
11 | 60a519a10 |
12 | 304b37a60 |
13 | 17a3c3219 |
14 | c53c66b6 |
15 | 7981d57c |
hex | 4dc42c28 |
1304701992 has 384 divisors, whose sum is σ = 4391936640. Its totient is φ = 358318080.
The previous prime is 1304701969. The next prime is 1304702011. The reversal of 1304701992 is 2991074031.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13450488 + ... + 13450584.
It is an arithmetic number, because the mean of its divisors is an integer number (11437335).
Almost surely, 21304701992 is an apocalyptic number.
1304701992 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 1304701992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2195968320).
1304701992 is an abundant number, since it is smaller than the sum of its proper divisors (3087234648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304701992 is a wasteful number, since it uses less digits than its factorization.
1304701992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183 (or 167 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The square root of 1304701992 is about 36120.6587979788. The cubic root of 1304701992 is about 1092.7071256265.
The spelling of 1304701992 in words is "one billion, three hundred four million, seven hundred one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •