Base | Representation |
---|---|
bin | 10011010110101010001… |
… | …111101011001100111100 |
3 | 11201010222001202210002020 |
4 | 103112222033223030330 |
5 | 133242320242132200 |
6 | 2454554420000140 |
7 | 165042445035513 |
oct | 23265217531474 |
9 | 4633861683066 |
10 | 1330001130300 |
11 | 473060a68457 |
12 | 19591a830050 |
13 | 98559796b4b |
14 | 4852dc0967a |
15 | 248e2bc3ea0 |
hex | 135aa3eb33c |
1330001130300 has 72 divisors (see below), whose sum is σ = 4015446911616. Its totient is φ = 339246663360.
The previous prime is 1330001130259. The next prime is 1330001130371. The reversal of 1330001130300 is 30311000331.
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 1330001130300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 96369994 + ... + 96383793.
Almost surely, 21330001130300 is an apocalyptic number.
1330001130300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330001130300 is an abundant number, since it is smaller than the sum of its proper divisors (2685445781316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330001130300 is a wasteful number, since it uses less digits than its factorization.
1330001130300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192753827 (or 192753820 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 1330001130300 its reverse (30311000331), we get a palindrome (1360312130631).
The spelling of 1330001130300 in words is "one trillion, three hundred thirty billion, one million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •