Base | Representation |
---|---|
bin | 10011001101101000000… |
… | …101111000101011010000 |
3 | 11200012221001220000220210 |
4 | 103031220011320223100 |
5 | 133112434120130300 |
6 | 2450312115404120 |
7 | 164250204106623 |
oct | 23155005705320 |
9 | 4605831800823 |
10 | 1320301333200 |
11 | 469a33756313 |
12 | 193a722b3640 |
13 | 97672048935 |
14 | 47c8d8addba |
15 | 24526365050 |
hex | 13368178ad0 |
1320301333200 has 60 divisors (see below), whose sum is σ = 4229365274528. Its totient is φ = 352080355200.
The previous prime is 1320301333157. The next prime is 1320301333201. The reversal of 1320301333200 is 23331030231.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×13203013332002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320301333201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 550124356 + ... + 550126755.
Almost surely, 21320301333200 is an apocalyptic number.
1320301333200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1320301333200 is an abundant number, since it is smaller than the sum of its proper divisors (2909063941328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320301333200 is a wasteful number, since it uses less digits than its factorization.
1320301333200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100251132 (or 1100251121 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1320301333200 its reverse (23331030231), we get a palindrome (1343632363431).
The spelling of 1320301333200 in words is "one trillion, three hundred twenty billion, three hundred one million, three hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •