Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0011110000101101000 |
3 | 100200020120220202202002 |
4 | 1132100222132011220 |
5 | 3124240043101300 |
6 | 114255033230132 |
7 | 10212052566653 |
oct | 1362052360550 |
9 | 320216822662 |
10 | 101211300200 |
11 | 39a1815a94a |
12 | 17747562348 |
13 | 970c75c51a |
14 | 4c81c9289a |
15 | 29757585d5 |
hex | 1790a9e168 |
101211300200 has 24 divisors (see below), whose sum is σ = 235316273430. Its totient is φ = 40484520000.
The previous prime is 101211300173. The next prime is 101211300209. The reversal of 101211300200 is 2003112101.
It can be written as a sum of positive squares in 3 ways, for example, as 53895479716 + 47315820484 = 232154^2 + 217522^2 .
It is not an unprimeable number, because it can be changed into a prime (101211300209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 253028051 + ... + 253028450.
Almost surely, 2101211300200 is an apocalyptic number.
101211300200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101211300200 is an abundant number, since it is smaller than the sum of its proper divisors (134104973230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211300200 is a wasteful number, since it uses less digits than its factorization.
101211300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506056517 (or 506056508 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 101211300200 its reverse (2003112101), we get a palindrome (103214412301).
The spelling of 101211300200 in words is "one hundred one billion, two hundred eleven million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •