Base | Representation |
---|---|
bin | 101111000101100111… |
… | …1000010000000010000 |
3 | 100200000020112110211210 |
4 | 1132023033002000100 |
5 | 3124043234034300 |
6 | 114242021140120 |
7 | 10206565461345 |
oct | 1361317020020 |
9 | 320006473753 |
10 | 101120221200 |
11 | 39980801949 |
12 | 17720b5a640 |
13 | 96c692041b |
14 | 4c73b447cc |
15 | 296c767050 |
hex | 178b3c2010 |
101120221200 has 120 divisors (see below), whose sum is σ = 328022358400. Its totient is φ = 26624033280.
The previous prime is 101120221199. The next prime is 101120221201. The reversal of 101120221200 is 2122021101.
It is an interprime number because it is at equal distance from previous prime (101120221199) and next prime (101120221201).
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (101120221201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 438535 + ... + 628134.
Almost surely, 2101120221200 is an apocalyptic number.
101120221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101120221200 is an abundant number, since it is smaller than the sum of its proper divisors (226902137200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120221200 is a wasteful number, since it uses less digits than its factorization.
101120221200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1066769 (or 1066758 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101120221200 its reverse (2122021101), we get a palindrome (103242242301).
The spelling of 101120221200 in words is "one hundred one billion, one hundred twenty million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •