Base | Representation |
---|---|
bin | 101111000010010111… |
… | …1001011111110000000 |
3 | 100122201122102010202002 |
4 | 1132010233023332000 |
5 | 3123332332210422 |
6 | 114223124443132 |
7 | 10204103055641 |
oct | 1360457137600 |
9 | 318648363662 |
10 | 101011210112 |
11 | 3992521623a |
12 | 176b05494a8 |
13 | 96aa173217 |
14 | 4c634896c8 |
15 | 2962dd2692 |
hex | 1784bcbf80 |
101011210112 has 32 divisors (see below), whose sum is σ = 209982548880. Its totient is φ = 48309707776.
The previous prime is 101011210051. The next prime is 101011210121. The reversal of 101011210112 is 211012110101.
101011210112 is nontrivially palindromic in base 15.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×1010112101122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101011210093 and 101011210102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17152493 + ... + 17158380.
Almost surely, 2101011210112 is an apocalyptic number.
It is an amenable number.
101011210112 is an abundant number, since it is smaller than the sum of its proper divisors (108971338768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011210112 is an equidigital number, since it uses as much as digits as its factorization.
101011210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34310910 (or 34310898 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101011210112 its reverse (211012110101), we get a palindrome (312023320213).
The spelling of 101011210112 in words is "one hundred one billion, eleven million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •