Base | Representation |
---|---|
bin | 11110000000111100100… |
… | …10100011001101001000 |
3 | 10122120222002111221201002 |
4 | 33000132102203031020 |
5 | 113344100341032222 |
6 | 2105434533114132 |
7 | 134336404112240 |
oct | 17003622431510 |
9 | 3576862457632 |
10 | 1031300330312 |
11 | 36841017237a |
12 | 147a58488948 |
13 | 76335b83055 |
14 | 37cb545ab20 |
15 | 1bc5e5e8392 |
hex | f01e4a3348 |
1031300330312 has 128 divisors (see below), whose sum is σ = 2266459937280. Its totient is φ = 430824960000.
The previous prime is 1031300330213. The next prime is 1031300330327. The reversal of 1031300330312 is 2130330031301.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 237789008 + ... + 237793344.
It is an arithmetic number, because the mean of its divisors is an integer number (17706718260).
Almost surely, 21031300330312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1031300330312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1133229968640).
1031300330312 is an abundant number, since it is smaller than the sum of its proper divisors (1235159606968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031300330312 is a wasteful number, since it uses less digits than its factorization.
1031300330312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5023 (or 5019 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1031300330312 its reverse (2130330031301), we get a palindrome (3161630361613).
The spelling of 1031300330312 in words is "one trillion, thirty-one billion, three hundred million, three hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •