Base | Representation |
---|---|
bin | 10010111110111100000… |
… | …110111011000010110000 |
3 | 11121201020000021012220210 |
4 | 102332330012323002300 |
5 | 132333134420201000 |
6 | 2435143203104120 |
7 | 163151331505143 |
oct | 22767406730260 |
9 | 4551200235823 |
10 | 1304531022000 |
11 | 463280831078 |
12 | 1909b0972040 |
13 | 9602aa4314b |
14 | 471d524c05a |
15 | 23e01ae0350 |
hex | 12fbc1bb0b0 |
1304531022000 has 160 divisors (see below), whose sum is σ = 4221804787200. Its totient is φ = 346551801600.
The previous prime is 1304531021957. The next prime is 1304531022017. The reversal of 1304531022000 is 2201354031.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1164651 + ... + 1991349.
It is an arithmetic number, because the mean of its divisors is an integer number (26386279920).
Almost surely, 21304531022000 is an apocalyptic number.
1304531022000 is a gapful number since it is divisible by the number (10) 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 1304531022000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2110902393600).
1304531022000 is an abundant number, since it is smaller than the sum of its proper divisors (2917273765200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304531022000 is a wasteful number, since it uses less digits than its factorization.
1304531022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826988 (or 826972 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 1304531022000 its reverse (2201354031), we get a palindrome (1306732376031).
The spelling of 1304531022000 in words is "one trillion, three hundred four billion, five hundred thirty-one million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •