Base | Representation |
---|---|
bin | 101110101010001100… |
… | …1011110101011010000 |
3 | 100120122010101020010102 |
4 | 1131110121132223100 |
5 | 3120202223310300 |
6 | 114010434151532 |
7 | 10145024521313 |
oct | 1352431365320 |
9 | 316563336112 |
10 | 100200213200 |
11 | 3954945425a |
12 | 17504a225a8 |
13 | 95ab13caa9 |
14 | 4bc789a97a |
15 | 2916ad70d5 |
hex | 175465ead0 |
100200213200 has 30 divisors (see below), whose sum is σ = 240731013174. Its totient is φ = 40080085120.
The previous prime is 100200213187. The next prime is 100200213203. The reversal of 100200213200 is 2312002001.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 7706176 + 100192507024 = 2776^2 + 316532^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200213203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 125249867 + ... + 125250666.
Almost surely, 2100200213200 is an apocalyptic number.
100200213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100200213200 is an abundant number, since it is smaller than the sum of its proper divisors (140530799974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100200213200 is a wasteful number, since it uses less digits than its factorization.
100200213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250500551 (or 250500540 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 100200213200 its reverse (2312002001), we get a palindrome (102512215201).
The spelling of 100200213200 in words is "one hundred billion, two hundred million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •