Base | Representation |
---|---|
bin | 10010111011111101011… |
… | …000101100010111001000 |
3 | 11121101222000022001111110 |
4 | 102323331120230113020 |
5 | 132310111243412300 |
6 | 2433453500330320 |
7 | 163006125651666 |
oct | 22737530542710 |
9 | 4541860261443 |
10 | 1301331232200 |
11 | 46198961169a |
12 | 1902592439a0 |
13 | 9593ab491bc |
14 | 46db02b9c36 |
15 | 23cb5c34550 |
hex | 12efd62c5c8 |
1301331232200 has 96 divisors (see below), whose sum is σ = 4064921926560. Its totient is φ = 344372620800.
The previous prime is 1301331232199. The next prime is 1301331232207. The reversal of 1301331232200 is 22321331031.
It is a super-3 number, since 3×13013312322003 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1301331232207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8199589 + ... + 8356788.
It is an arithmetic number, because the mean of its divisors is an integer number (42342936735).
Almost surely, 21301331232200 is an apocalyptic number.
1301331232200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1301331232200 is an abundant number, since it is smaller than the sum of its proper divisors (2763590694360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301331232200 is a wasteful number, since it uses less digits than its factorization.
1301331232200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16556527 (or 16556518 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1301331232200 its reverse (22321331031), we get a palindrome (1323652563231).
The spelling of 1301331232200 in words is "one trillion, three hundred one billion, three hundred thirty-one million, two hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •