Base | Representation |
---|---|
bin | 110000011011111000010011… |
… | …001100100010010010101100 |
3 | 1000221020201022002222222100220 |
4 | 300123320103030202102230 |
5 | 210410123240130002200 |
6 | 2033021001212051340 |
7 | 62604224320100406 |
oct | 6033702314422254 |
9 | 1027221262888326 |
10 | 213022110000300 |
11 | 6196a195690567 |
12 | 1ba85141763b50 |
13 | 91b2b8b8017c3 |
14 | 3a8647a261b76 |
15 | 19962d98324a0 |
hex | c1be133224ac |
213022110000300 has 72 divisors (see below), whose sum is σ = 616353707004672. Its totient is φ = 56804998728000.
The previous prime is 213022110000289. The next prime is 213022110000313. The reversal of 213022110000300 is 3000011220312.
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 213022110000300.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13525185 + ... + 24677415.
Almost surely, 2213022110000300 is an apocalyptic number.
213022110000300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213022110000300 is an abundant number, since it is smaller than the sum of its proper divisors (403331597004372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213022110000300 is a wasteful number, since it uses less digits than its factorization.
213022110000300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11215919 (or 11215912 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 213022110000300 its reverse (3000011220312), we get a palindrome (216022121220612).
The spelling of 213022110000300 in words is "two hundred thirteen trillion, twenty-two billion, one hundred ten million, three hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •