Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …111101000101001101111000 |
3 | 111021000010012021102221010020 |
4 | 112333112331331011031320 |
5 | 101223100323034133422 |
6 | 555013431354050440 |
7 | 30204013064410512 |
oct | 2677267575051570 |
9 | 437003167387106 |
10 | 101111012021112 |
11 | 2a242a37366665 |
12 | b40bba9419a20 |
13 | 445595c497332 |
14 | 1ad7b289d8bb2 |
15 | ba51e1dd695c |
hex | 5bf5bdf45378 |
101111012021112 has 64 divisors (see below), whose sum is σ = 253114080055200. Its totient is φ = 33658806650880.
The previous prime is 101111012021087. The next prime is 101111012021161. The reversal of 101111012021112 is 211120210111101.
It is a super-2 number, since 2×1011110120211122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101111012021091 and 101111012021100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 176439108 + ... + 177011244.
Almost surely, 2101111012021112 is an apocalyptic number.
101111012021112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101111012021112 is an abundant number, since it is smaller than the sum of its proper divisors (152003068034088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111012021112 is a wasteful number, since it uses less digits than its factorization.
101111012021112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581936 (or 581932 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101111012021112 its reverse (211120210111101), we get a palindrome (312231222132213).
The spelling of 101111012021112 in words is "one hundred one trillion, one hundred eleven billion, twelve million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •