Base | Representation |
---|---|
bin | 101111110011000000010100… |
… | …011000011111011100100000 |
3 | 1000120022012001211100121212222 |
4 | 233303000110120133130200 |
5 | 210023113134123100000 |
6 | 2023030342023010212 |
7 | 62164255406063222 |
oct | 5763002430373440 |
9 | 1016265054317788 |
10 | 210213221300000 |
11 | 60a86a211a3986 |
12 | 1b6b0892599968 |
13 | 903b03890c5b9 |
14 | 39ca534b28412 |
15 | 19481dd01da85 |
hex | bf301461f720 |
210213221300000 has 72 divisors (see below), whose sum is σ = 517288490956692. Its totient is φ = 84085288480000.
The previous prime is 210213221299973. The next prime is 210213221300003. The reversal of 210213221300000 is 3122312012.
It can be written as a sum of positive squares in 6 ways, for example, as 9201733966096 + 201011487333904 = 3033436^2 + 14177852^2 .
It is not an unprimeable number, because it can be changed into a prime (210213221300003) 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, 1050966107 + ... + 1051166106.
Almost surely, 2210213221300000 is an apocalyptic number.
210213221300000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210213221300000 is an abundant number, since it is smaller than the sum of its proper divisors (307075269656692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210213221300000 is an frugal number, since it uses more digits than its factorization.
210213221300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2102132248 (or 2102132220 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 210213221300000 its reverse (3122312012), we get a palindrome (210216343612012).
The spelling of 210213221300000 in words is "two hundred ten trillion, two hundred thirteen billion, two hundred twenty-one million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •