Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …110011101110011011000100 |
3 | 111020222011122020221111121110 |
4 | 112333031233303232123010 |
5 | 101222420033404323022 |
6 | 555005113105045020 |
7 | 30203212531253040 |
oct | 2677155763563304 |
9 | 436864566844543 |
10 | 101101111011012 |
11 | 2a239816513192 |
12 | b40a0a5626770 |
13 | 4454a42158988 |
14 | 1ad7469a83020 |
15 | ba4d12a7e00c |
hex | 5bf36fcee6c4 |
101101111011012 has 24 divisors (see below), whose sum is σ = 269602962696256. Its totient is φ = 28886031717408.
The previous prime is 101101111011001. The next prime is 101101111011053. The reversal of 101101111011012 is 210110111101101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 601792327363 + ... + 601792327530.
Almost surely, 2101101111011012 is an apocalyptic number.
101101111011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101101111011012 is an abundant number, since it is smaller than the sum of its proper divisors (168501851685244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101111011012 is a wasteful number, since it uses less digits than its factorization.
101101111011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1203584654907 (or 1203584654905 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 101101111011012 its reverse (210110111101101), we get a palindrome (311211222112113).
It can be divided in two parts, 10110111101101 and 2, that multiplied together give a palindrome (20220222202202).
The spelling of 101101111011012 in words is "one hundred one trillion, one hundred one billion, one hundred eleven million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •