| Base | Representation |
|---|---|
| bin | 10110111111001101101111… |
| … | …110100011100110011101000 |
| 3 | 111020222011122021022011020001 |
| 4 | 112333031233310130303220 |
| 5 | 101222420033431413000 |
| 6 | 555005113113112344 |
| 7 | 30203212533003661 |
| oct | 2677155764346350 |
| 9 | 436864567264201 |
| 10 | 101101111201000 |
| 11 | 2a2398166329a9 |
| 12 | b40a0a56b86b4 |
| 13 | 4454a421c42b1 |
| 14 | 1ad7469ad2368 |
| 15 | ba4d12aba46a |
| hex | 5bf36fd1cce8 |
101101111201000 has 512 divisors, whose sum is σ = 256395203850240. Its totient is φ = 37217664000000.
The previous prime is 101101111200961. The next prime is 101101111201009. The reversal of 101101111201000 is 102111101101.
101101111201000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (101101111201009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 25810851042 + ... + 25810854958.
It is an arithmetic number, because the mean of its divisors is an integer number (500771882520).
Almost surely, 2101101111201000 is an apocalyptic number.
101101111201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101101111201000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128197601925120).
101101111201000 is an abundant number, since it is smaller than the sum of its proper divisors (155294092649240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101111201000 is a wasteful number, since it uses less digits than its factorization.
101101111201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4374 (or 4360 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101101111201000 its reverse (102111101101), we get a palindrome (101203222302101).
The spelling of 101101111201000 in words is "one hundred one trillion, one hundred one billion, one hundred eleven million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •