Base | Representation |
---|---|
bin | 1100011001100110010… |
… | …1110011010111110100 |
3 | 202100212102221111210022 |
4 | 3012121211303113310 |
5 | 11442241214040200 |
6 | 241510440544312 |
7 | 21251042001251 |
oct | 3063145632764 |
9 | 670772844708 |
10 | 213030221300 |
11 | 82389008336 |
12 | 35353482098 |
13 | 1711ca427b0 |
14 | a44c876428 |
15 | 581c395885 |
hex | 31999735f4 |
213030221300 has 288 divisors, whose sum is σ = 531265996800. Its totient is φ = 73580451840.
The previous prime is 213030221293. The next prime is 213030221311. The reversal of 213030221300 is 3122030312.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 193136549 + ... + 193137651.
It is an arithmetic number, because the mean of its divisors is an integer number (1844673600).
Almost surely, 2213030221300 is an apocalyptic number.
213030221300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213030221300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (265632998400).
213030221300 is an abundant number, since it is smaller than the sum of its proper divisors (318235775500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213030221300 is a wasteful number, since it uses less digits than its factorization.
213030221300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315 (or 1308 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 213030221300 its reverse (3122030312), we get a palindrome (216152251612).
The spelling of 213030221300 in words is "two hundred thirteen billion, thirty million, two hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •