Base | Representation |
---|---|
bin | 10110111111010111001010… |
… | …011010101100010101100000 |
3 | 111021000010201211212202022021 |
4 | 112333113022122230111200 |
5 | 101223101240101010422 |
6 | 555013504223351224 |
7 | 30204021213551443 |
oct | 2677271232542540 |
9 | 437003654782267 |
10 | 101111221110112 |
11 | 2a243034397294 |
12 | b410047452514 |
13 | 44559938b4635 |
14 | 1ad7b486a565a |
15 | ba5205438dc7 |
hex | 5bf5ca6ac560 |
101111221110112 has 48 divisors (see below), whose sum is σ = 202683429591552. Its totient is φ = 49640916885120.
The previous prime is 101111221110103. The next prime is 101111221110131. The reversal of 101111221110112 is 211011122111101.
101111221110112 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 (16).
It is a congruent number.
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, 75153288 + ... + 76486855.
It is an arithmetic number, because the mean of its divisors is an integer number (4222571449824).
Almost surely, 2101111221110112 is an apocalyptic number.
It is an amenable number.
101111221110112 is an abundant number, since it is smaller than the sum of its proper divisors (101572208481440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111221110112 is a wasteful number, since it uses less digits than its factorization.
101111221110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151640531 (or 151640523 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 101111221110112 its reverse (211011122111101), we get a palindrome (312122343221213).
The spelling of 101111221110112 in words is "one hundred one trillion, one hundred eleven billion, two hundred twenty-one million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •