Base | Representation |
---|---|
bin | 10111001101111011010011… |
… | …100000100000101100100011 |
3 | 111101112211011212222201210212 |
4 | 113031323103200200230203 |
5 | 101341001040324311321 |
6 | 1001101352425244335 |
7 | 30336233024413055 |
oct | 2715732340405443 |
9 | 441484155881725 |
10 | 102112101010211 |
11 | 2a599553a66146 |
12 | b5520140336ab |
13 | 44c918c259b06 |
14 | 1b303759158d5 |
15 | bc128405b55b |
hex | 5cded3820b23 |
102112101010211 has 4 divisors (see below), whose sum is σ = 104038744425552. Its totient is φ = 100185457594872.
The previous prime is 102112101010187. The next prime is 102112101010237. The reversal of 102112101010211 is 112010101211201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102112101010211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102112101010291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 963321707591 + ... + 963321707696.
It is an arithmetic number, because the mean of its divisors is an integer number (26009686106388).
Almost surely, 2102112101010211 is an apocalyptic number.
102112101010211 is a deficient number, since it is larger than the sum of its proper divisors (1926643415341).
102112101010211 is an equidigital number, since it uses as much as digits as its factorization.
102112101010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1926643415340.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102112101010211 its reverse (112010101211201), we get a palindrome (214122202221412).
The spelling of 102112101010211 in words is "one hundred two trillion, one hundred twelve billion, one hundred one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •