Base | Representation |
---|---|
bin | 1100011001011111011… |
… | …1100011011101101100 |
3 | 202100210102120012001220 |
4 | 3012113313203131230 |
5 | 11442211314222200 |
6 | 241503525303340 |
7 | 21250241230626 |
oct | 3062767433554 |
9 | 670712505056 |
10 | 213001320300 |
11 | 8237376860a |
12 | 35345864b50 |
13 | 17116a63b02 |
14 | a448ab1c16 |
15 | 5819a874a0 |
hex | 3197de376c |
213001320300 has 72 divisors (see below), whose sum is σ = 622637346576. Its totient is φ = 56214773760.
The previous prime is 213001320299. The next prime is 213001320307. The reversal of 213001320300 is 3023100312.
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 213001320300.
It is not an unprimeable number, because it can be changed into a prime (213001320307) by changing a digit.
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, 3630717 + ... + 3688916.
Almost surely, 2213001320300 is an apocalyptic number.
213001320300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213001320300 is an abundant number, since it is smaller than the sum of its proper divisors (409636026276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213001320300 is a wasteful number, since it uses less digits than its factorization.
213001320300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7319747 (or 7319740 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 213001320300 its reverse (3023100312), we get a palindrome (216024420612).
The spelling of 213001320300 in words is "two hundred thirteen billion, one million, three hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •