Base | Representation |
---|---|
bin | 10010111111111011… |
… | …11111100011010000 |
3 | 222022212010202121222 |
4 | 21133331333203100 |
5 | 131342201134300 |
6 | 4404045504212 |
7 | 510523515065 |
oct | 113775774320 |
9 | 28285122558 |
10 | 10200021200 |
11 | 4364711996 |
12 | 1b87b72068 |
13 | c67281305 |
14 | 6ca94cc6c |
15 | 3ea71d785 |
hex | 25ff7f8d0 |
10200021200 has 30 divisors (see below), whose sum is σ = 24505551894. Its totient is φ = 4080008320.
The previous prime is 10200021197. The next prime is 10200021203. The reversal of 10200021200 is 212000201.
It is an interprime number because it is at equal distance from previous prime (10200021197) and next prime (10200021203).
It can be written as a sum of positive squares in 3 ways, for example, as 1218289216 + 8981731984 = 34904^2 + 94772^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200021203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12749627 + ... + 12750426.
Almost surely, 210200021200 is an apocalyptic number.
10200021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200021200 is an abundant number, since it is smaller than the sum of its proper divisors (14305530694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200021200 is a wasteful number, since it uses less digits than its factorization.
10200021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25500071 (or 25500060 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 10200021200 its reverse (212000201), we get a palindrome (10412021401).
The spelling of 10200021200 in words is "ten billion, two hundred million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •