Base | Representation |
---|---|
bin | 10110111111011000000101… |
… | …010111011001001100010011 |
3 | 111021000020021202211200202211 |
4 | 112333120011113121030103 |
5 | 101223110301241213021 |
6 | 555014150313052551 |
7 | 30204054553051024 |
oct | 2677300527311423 |
9 | 437006252750684 |
10 | 101112210101011 |
11 | 2a2434a168083a |
12 | b4102826b7157 |
13 | 4455ac0768855 |
14 | 1ad7bddb88c4b |
15 | ba52621933e1 |
hex | 5bf6055d9313 |
101112210101011 has 4 divisors (see below), whose sum is σ = 102497308869592. Its totient is φ = 99727111332432.
The previous prime is 101112210100927. The next prime is 101112210101029. The reversal of 101112210101011 is 110101012211101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101112210101011 - 213 = 101112210092819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101112210100982 and 101112210101000.
It is not an unprimeable number, because it can be changed into a prime (101112210101711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 692549384181 + ... + 692549384326.
It is an arithmetic number, because the mean of its divisors is an integer number (25624327217398).
Almost surely, 2101112210101011 is an apocalyptic number.
101112210101011 is a deficient number, since it is larger than the sum of its proper divisors (1385098768581).
101112210101011 is an equidigital number, since it uses as much as digits as its factorization.
101112210101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1385098768580.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101112210101011 its reverse (110101012211101), we get a palindrome (211213222312112).
The spelling of 101112210101011 in words is "one hundred one trillion, one hundred twelve billion, two hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •