Base | Representation |
---|---|
bin | 11110000000101000010… |
… | …10000000110101001000 |
3 | 10122120112020121112200021 |
4 | 33000110022000311020 |
5 | 113343223330221300 |
6 | 2105410021150224 |
7 | 134332241052031 |
oct | 17002412006510 |
9 | 3576466545607 |
10 | 1031130320200 |
11 | 368333203252 |
12 | 147a0b55b374 |
13 | 76309899256 |
14 | 37c9aa43a88 |
15 | 1bc4e714d1a |
hex | f014280d48 |
1031130320200 has 48 divisors (see below), whose sum is σ = 2397447373860. Its totient is φ = 412440192000.
The previous prime is 1031130320179. The next prime is 1031130320203. The reversal of 1031130320200 is 20230311301.
It can be written as a sum of positive squares in 6 ways, for example, as 529614240516 + 501516079684 = 727746^2 + 708178^2 .
It is not an unprimeable number, because it can be changed into a prime (1031130320203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10824780 + ... + 10919620.
Almost surely, 21031130320200 is an apocalyptic number.
1031130320200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031130320200 is an abundant number, since it is smaller than the sum of its proper divisors (1366317053660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031130320200 is a wasteful number, since it uses less digits than its factorization.
1031130320200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149218 (or 149209 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1031130320200 its reverse (20230311301), we get a palindrome (1051360631501).
The spelling of 1031130320200 in words is "one trillion, thirty-one billion, one hundred thirty million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •