Base | Representation |
---|---|
bin | 11101001000110000010… |
… | …00101001101111110100 |
3 | 10112201002122001021212020 |
4 | 32210120020221233310 |
5 | 112400304332120200 |
6 | 2043525215353140 |
7 | 132220664104005 |
oct | 16443010515764 |
9 | 3481078037766 |
10 | 1001132301300 |
11 | 35663a0a269a |
12 | 1420392227b0 |
13 | 73538a48b01 |
14 | 366529931ac |
15 | 1b095d7cea0 |
hex | e918229bf4 |
1001132301300 has 36 divisors (see below), whose sum is σ = 2896609459296. Its totient is φ = 266968613600.
The previous prime is 1001132301293. The next prime is 1001132301329. The reversal of 1001132301300 is 31032311001.
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 1001132301300.
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, 1668553536 + ... + 1668554135.
Almost surely, 21001132301300 is an apocalyptic number.
1001132301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001132301300 is an abundant number, since it is smaller than the sum of its proper divisors (1895477157996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001132301300 is a wasteful number, since it uses less digits than its factorization.
1001132301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3337107688 (or 3337107681 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1001132301300 its reverse (31032311001), we get a palindrome (1032164612301).
The spelling of 1001132301300 in words is "one trillion, one billion, one hundred thirty-two million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •