Base | Representation |
---|---|
bin | 1100011010001111010… |
… | …1111011101110110000 |
3 | 202101022102121001101121 |
4 | 3012203311323232300 |
5 | 11443114232101000 |
6 | 241535503312024 |
7 | 21255230662105 |
oct | 3064365735660 |
9 | 671272531347 |
10 | 213202222000 |
11 | 82467106a79 |
12 | 353a0bab614 |
13 | 17149575661 |
14 | a46764aaac |
15 | 582c51db1a |
hex | 31a3d7bbb0 |
213202222000 has 80 divisors (see below), whose sum is σ = 518222974464. Its totient is φ = 84834240000.
The previous prime is 213202221977. The next prime is 213202222061. The reversal of 213202222000 is 222202312.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102940 + ... + 661060.
Almost surely, 2213202222000 is an apocalyptic number.
213202222000 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 213202222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259111487232).
213202222000 is an abundant number, since it is smaller than the sum of its proper divisors (305020752464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213202222000 is a wasteful number, since it uses less digits than its factorization.
213202222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558335 (or 558319 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 213202222000 its reverse (222202312), we get a palindrome (213424424312).
The spelling of 213202222000 in words is "two hundred thirteen billion, two hundred two million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •