Base | Representation |
---|---|
bin | 101111000010010111… |
… | …1001110101011010000 |
3 | 100122201122102200221202 |
4 | 1132010233032223100 |
5 | 3123332333034300 |
6 | 114223125010332 |
7 | 10204103133161 |
oct | 1360457165320 |
9 | 318648380852 |
10 | 101011221200 |
11 | 399252235aa |
12 | 176b05539a8 |
13 | 96aa178296 |
14 | 4c6348d768 |
15 | 2962dd5ad5 |
hex | 1784bcead0 |
101011221200 has 60 divisors (see below), whose sum is σ = 242711340108. Its totient is φ = 40399180800.
The previous prime is 101011221167. The next prime is 101011221281. The reversal of 101011221200 is 2122110101.
It can be written as a sum of positive squares in 6 ways, for example, as 22328727184 + 78682494016 = 149428^2 + 280504^2 .
It is a super-3 number, since 3×1010112212003 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 4722530 + ... + 4743870.
Almost surely, 2101011221200 is an apocalyptic number.
101011221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101011221200 is an abundant number, since it is smaller than the sum of its proper divisors (141700118908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011221200 is a wasteful number, since it uses less digits than its factorization.
101011221200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33192 (or 33181 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101011221200 its reverse (2122110101), we get a palindrome (103133331301).
The spelling of 101011221200 in words is "one hundred one billion, eleven million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •