Base | Representation |
---|---|
bin | 10110111111001110101011… |
… | …111101001000110001101011 |
3 | 111020222021020120202002211220 |
4 | 112333032223331020301223 |
5 | 101222424120222024321 |
6 | 555005401153353123 |
7 | 30203246533415112 |
oct | 2677165375106153 |
9 | 436867216662756 |
10 | 101102120111211 |
11 | 2a23a19409209a |
12 | b40a3275687a3 |
13 | 4454b73230c9b |
14 | 1ad7523abcc79 |
15 | ba4d7145b9c6 |
hex | 5bf3abf48c6b |
101102120111211 has 16 divisors (see below), whose sum is σ = 134821661251200. Its totient is φ = 67391996803200.
The previous prime is 101102120111197. The next prime is 101102120111219. The reversal of 101102120111211 is 112111021201101.
It is not a de Polignac number, because 101102120111211 - 29 = 101102120110699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101102120111219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 878335140 + ... + 878450238.
It is an arithmetic number, because the mean of its divisors is an integer number (8426353828200).
Almost surely, 2101102120111211 is an apocalyptic number.
101102120111211 is a deficient number, since it is larger than the sum of its proper divisors (33719541139989).
101102120111211 is a wasteful number, since it uses less digits than its factorization.
101102120111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153466.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101102120111211 its reverse (112111021201101), we get a palindrome (213213141312312).
The spelling of 101102120111211 in words is "one hundred one trillion, one hundred two billion, one hundred twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •