Base | Representation |
---|---|
bin | 10111000010100100001001… |
… | …010101110000000001101011 |
3 | 111021210011211220222111000210 |
4 | 113002210021111300001223 |
5 | 101240203020422024321 |
6 | 555302544341032203 |
7 | 30225642401314341 |
oct | 2702441125600153 |
9 | 437704756874023 |
10 | 101331320111211 |
11 | 2a31840a5564a3 |
12 | b4468320b5663 |
13 | 447066bc62368 |
14 | 1b04667c7d991 |
15 | baacd8182b76 |
hex | 5c290957006b |
101331320111211 has 16 divisors (see below), whose sum is σ = 137474058382848. Its totient is φ = 66373828903200.
The previous prime is 101331320111209. The next prime is 101331320111233. The reversal of 101331320111211 is 112111023133101.
It is not a de Polignac number, because 101331320111211 - 21 = 101331320111209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101331320111291) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 303742761 + ... + 304076186.
It is an arithmetic number, because the mean of its divisors is an integer number (8592128648928).
Almost surely, 2101331320111211 is an apocalyptic number.
101331320111211 is a deficient number, since it is larger than the sum of its proper divisors (36142738271637).
101331320111211 is an equidigital number, since it uses as much as digits as its factorization.
101331320111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607819922.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 101331320111211 its reverse (112111023133101), we get a palindrome (213442343244312).
The spelling of 101331320111211 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •