Base | Representation |
---|---|
bin | 10111000010000111000110… |
… | …010100101111011011111111 |
3 | 111021200012100022011120121220 |
4 | 113002013012110233123333 |
5 | 101234200132014031421 |
6 | 555240345430124423 |
7 | 30223456452260166 |
oct | 2702070624573377 |
9 | 437605308146556 |
10 | 101300131002111 |
11 | 2a306165075178 |
12 | b440788ab0713 |
13 | 446a73b41a012 |
14 | 1b02d4993c3dd |
15 | baa0aee703c6 |
hex | 5c21c652f6ff |
101300131002111 has 4 divisors (see below), whose sum is σ = 135066841336152. Its totient is φ = 67533420668072.
The previous prime is 101300131002061. The next prime is 101300131002143. The reversal of 101300131002111 is 111200131003101.
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 101300131002111 - 217 = 101300130871039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101300131002911) 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, 16883355167016 + ... + 16883355167021.
It is an arithmetic number, because the mean of its divisors is an integer number (33766710334038).
Almost surely, 2101300131002111 is an apocalyptic number.
101300131002111 is a deficient number, since it is larger than the sum of its proper divisors (33766710334041).
101300131002111 is an equidigital number, since it uses as much as digits as its factorization.
101300131002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33766710334040.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 101300131002111 its reverse (111200131003101), we get a palindrome (212500262005212).
The spelling of 101300131002111 in words is "one hundred one trillion, three hundred billion, one hundred thirty-one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •