Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …010110011001111100111000 |
3 | 111020222011122220001101101010 |
4 | 112333031300112121330320 |
5 | 101222420043221232300 |
6 | 555005114031553520 |
7 | 30203213001446001 |
oct | 2677156026317470 |
9 | 436864586041333 |
10 | 101101120102200 |
11 | 2a239820662569 |
12 | b40a0a868b8a0 |
13 | 4454a43cbc98a |
14 | 1ad746ad6c1a8 |
15 | ba4d13777a50 |
hex | 5bf370599f38 |
101101120102200 has 96 divisors (see below), whose sum is σ = 313887624035760. Its totient is φ = 26919511449600.
The previous prime is 101101120102187. The next prime is 101101120102271. The reversal of 101101120102200 is 2201021101101.
It is a super-3 number, since 3×1011011201022003 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 127063209 + ... + 127856408.
Almost surely, 2101101120102200 is an apocalyptic number.
101101120102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101101120102200 is an abundant number, since it is smaller than the sum of its proper divisors (212786503933560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101120102200 is a wasteful number, since it uses less digits than its factorization.
101101120102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254920297 (or 254920288 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101101120102200 its reverse (2201021101101), we get a palindrome (103302141203301).
The spelling of 101101120102200 in words is "one hundred one trillion, one hundred one billion, one hundred twenty million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •