Base | Representation |
---|---|
bin | 10011000000000101… |
… | …11111001000011000 |
3 | 222022221121021020110 |
4 | 21200002333020120 |
5 | 131343020031300 |
6 | 4404133524320 |
7 | 510540606315 |
oct | 114002771030 |
9 | 28287537213 |
10 | 10201330200 |
11 | 4365426406 |
12 | 1b884a36a0 |
13 | c6761c079 |
14 | 6cabadd0c |
15 | 3ea8cb550 |
hex | 2600bf218 |
10201330200 has 48 divisors (see below), whose sum is σ = 31624125480. Its totient is φ = 2720354560.
The previous prime is 10201330193. The next prime is 10201330207. The reversal of 10201330200 is 203310201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10201330193) and next prime (10201330207).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201330207) by changing a digit.
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, 8500509 + ... + 8501708.
Almost surely, 210201330200 is an apocalyptic number.
10201330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201330200 is an abundant number, since it is smaller than the sum of its proper divisors (21422795280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201330200 is a wasteful number, since it uses less digits than its factorization.
10201330200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17002236 (or 17002227 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10201330200 its reverse (203310201), we get a palindrome (10404640401).
The spelling of 10201330200 in words is "ten billion, two hundred one million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •