Base | Representation |
---|---|
bin | 101101100001011110111110… |
… | …110000111110100011010000 |
3 | 222020220012000020210011120221 |
4 | 231201132332300332203100 |
5 | 202220242412324410300 |
6 | 1545452343455442424 |
7 | 60112630200121342 |
oct | 5541367660764320 |
9 | 866805006704527 |
10 | 200213101013200 |
11 | 58880998a82690 |
12 | 1a556782526414 |
13 | 8794025889772 |
14 | 3762519a47292 |
15 | 182300776a31a |
hex | b617bec3e8d0 |
200213101013200 has 120 divisors (see below), whose sum is σ = 531382620228480. Its totient is φ = 71883184588800.
The previous prime is 200213101013183. The next prime is 200213101013243. The reversal of 200213101013200 is 2310101312002.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
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, 287645929 + ... + 288341128.
It is an arithmetic number, because the mean of its divisors is an integer number (4428188501904).
Almost surely, 2200213101013200 is an apocalyptic number.
200213101013200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200213101013200 is an abundant number, since it is smaller than the sum of its proper divisors (331169519215280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200213101013200 is a wasteful number, since it uses less digits than its factorization.
200213101013200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575987165 (or 575987154 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 200213101013200 its reverse (2310101312002), we get a palindrome (202523202325202).
The spelling of 200213101013200 in words is "two hundred trillion, two hundred thirteen billion, one hundred one million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •