Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …101101100110111011101011 |
3 | 111020222001202222100120001110 |
4 | 112333030231231212323223 |
5 | 101222410301020024321 |
6 | 555004411053321403 |
7 | 30203143204622025 |
oct | 2677145555467353 |
9 | 436861688316043 |
10 | 101100002111211 |
11 | 2a2392a757a374 |
12 | b409a36196263 |
13 | 44548c64b014c |
14 | 1ad73a26a9015 |
15 | ba4c9a53b176 |
hex | 5bf32db66eeb |
101100002111211 has 8 divisors (see below), whose sum is σ = 134810844978640. Its totient is φ = 67394580325632.
The previous prime is 101100002111201. The next prime is 101100002111231. The reversal of 101100002111211 is 112111200001101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101100002111211 - 223 = 101099993722603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101100002111201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1355226946 + ... + 1355301543.
It is an arithmetic number, because the mean of its divisors is an integer number (16851355622330).
Almost surely, 2101100002111211 is an apocalyptic number.
101100002111211 is a deficient number, since it is larger than the sum of its proper divisors (33710842867429).
101100002111211 is a wasteful number, since it uses less digits than its factorization.
101100002111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2710540925.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101100002111211 its reverse (112111200001101), we get a palindrome (213211202112312).
The spelling of 101100002111211 in words is "one hundred one trillion, one hundred billion, two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •