Base | Representation |
---|---|
bin | 11110000000100110010… |
… | …00010100111111110100 |
3 | 10122120111001012201210020 |
4 | 33000103020110333310 |
5 | 113343204423220200 |
6 | 2105404204125140 |
7 | 134331641515122 |
oct | 17002310247764 |
9 | 3576431181706 |
10 | 1031113101300 |
11 | 368324512457 |
12 | 147a058367b0 |
13 | 7630614a959 |
14 | 37c98640912 |
15 | 1bc4ce62ea0 |
hex | f013214ff4 |
1031113101300 has 36 divisors (see below), whose sum is σ = 2983353907296. Its totient is φ = 274963493600.
The previous prime is 1031113101299. The next prime is 1031113101341. The reversal of 1031113101300 is 31013111301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1031113101300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1718521536 + ... + 1718522135.
Almost surely, 21031113101300 is an apocalyptic number.
1031113101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031113101300 is an abundant number, since it is smaller than the sum of its proper divisors (1952240805996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031113101300 is a wasteful number, since it uses less digits than its factorization.
1031113101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437043688 (or 3437043681 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1031113101300 its reverse (31013111301), we get a palindrome (1062126212601).
The spelling of 1031113101300 in words is "one trillion, thirty-one billion, one hundred thirteen million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •