Base | Representation |
---|---|
bin | 10011000000000100… |
… | …00110111110101000 |
3 | 222022221011120201221 |
4 | 21200002012332220 |
5 | 131342440201300 |
6 | 4404124551424 |
7 | 510535630624 |
oct | 114002067650 |
9 | 28287146657 |
10 | 10201100200 |
11 | 4365289625 |
12 | 1b883b2574 |
13 | c6756b485 |
14 | 6cab50184 |
15 | 3ea88331a |
hex | 260086fa8 |
10201100200 has 48 divisors (see below), whose sum is σ = 23769220860. Its totient is φ = 4071552000.
The previous prime is 10201100197. The next prime is 10201100213. The reversal of 10201100200 is 200110201.
It can be written as a sum of positive squares in 6 ways, for example, as 2575968516 + 7625131684 = 50754^2 + 87322^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36880 + ... + 147520.
Almost surely, 210201100200 is an apocalyptic number.
10201100200 is a gapful number since it is divisible by the number (10) 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 10201100200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11884610430).
10201100200 is an abundant number, since it is smaller than the sum of its proper divisors (13568120660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201100200 is a wasteful number, since it uses less digits than its factorization.
10201100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111118 (or 111109 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 10201100200 its reverse (200110201), we get a palindrome (10401210401).
The spelling of 10201100200 in words is "ten billion, two hundred one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •