Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1100101110101010000 |
3 | 100200020111111210021201 |
4 | 1132100211211311100 |
5 | 3124234231134300 |
6 | 114254550000544 |
7 | 10212035662051 |
oct | 1362045456520 |
9 | 320214453251 |
10 | 101210021200 |
11 | 39a17466a22 |
12 | 17747046154 |
13 | 970c402312 |
14 | 4c81a3c728 |
15 | 29755a466a |
hex | 1790965d50 |
101210021200 has 60 divisors (see below), whose sum is σ = 243329320768. Its totient is φ = 40455331200.
The previous prime is 101210021113. The next prime is 101210021207. The reversal of 101210021200 is 2120012101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210021207) 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 11 ways as a sum of consecutive naturals, for example, 480295 + ... + 658105.
Almost surely, 2101210021200 is an apocalyptic number.
101210021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101210021200 is an abundant number, since it is smaller than the sum of its proper divisors (142119299568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210021200 is a wasteful number, since it uses less digits than its factorization.
101210021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179252 (or 179241 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101210021200 its reverse (2120012101), we get a palindrome (103330033301).
Subtracting from 101210021200 its reverse (2120012101), we obtain a palindrome (99090009099).
The spelling of 101210021200 in words is "one hundred one billion, two hundred ten million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •