Base | Representation |
---|---|
bin | 110000011101011110110110… |
… | …010001100111100000101000 |
3 | 1000221122020111212202201200101 |
4 | 300131132312101213200220 |
5 | 210413424241332413000 |
6 | 2033143331255515144 |
7 | 62615203050256612 |
oct | 6035366621474050 |
9 | 1027566455681611 |
10 | 213132220201000 |
11 | 61a01959a5a031 |
12 | 1baa2551388ab4 |
13 | 91c0388aa4209 |
14 | 3a8b923d2ddb2 |
15 | 19990d1446e6a |
hex | c1d7b6467828 |
213132220201000 has 64 divisors (see below), whose sum is σ = 499423040064000. Its totient is φ = 85134316321600.
The previous prime is 213132220200997. The next prime is 213132220201049. The reversal of 213132220201000 is 102022231312.
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 15 ways as a sum of consecutive naturals, for example, 147495340 + ... + 148933339.
It is an arithmetic number, because the mean of its divisors is an integer number (7803485001000).
Almost surely, 2213132220201000 is an apocalyptic number.
213132220201000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213132220201000 is an abundant number, since it is smaller than the sum of its proper divisors (286290819863000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213132220201000 is a wasteful number, since it uses less digits than its factorization.
213132220201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296429419 (or 296429405 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 213132220201000 its reverse (102022231312), we get a palindrome (213234242432312).
The spelling of 213132220201000 in words is "two hundred thirteen trillion, one hundred thirty-two billion, two hundred twenty million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •