Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …010001001111100111100011 |
3 | 111010110112021112011110220011 |
4 | 112300303233101033213203 |
5 | 101110210024133311321 |
6 | 552530224314425351 |
7 | 30041534452510051 |
oct | 2660635721174743 |
9 | 433415245143804 |
10 | 100111112010211 |
11 | 2999797a924a95 |
12 | b28a254a32257 |
13 | 43b258bb3a353 |
14 | 1aa159197d1d1 |
15 | b891be321ae1 |
hex | 5b0cef44f9e3 |
100111112010211 has 4 divisors (see below), whose sum is σ = 100111267774512. Its totient is φ = 100110956245912.
The previous prime is 100111112010197. The next prime is 100111112010223. The reversal of 100111112010211 is 112010211111001.
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 100111112010211 - 213 = 100111112002019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100111112010191 and 100111112010200.
It is not an unprimeable number, because it can be changed into a prime (100111112016211) 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, 76914076 + ... + 78204841.
It is an arithmetic number, because the mean of its divisors is an integer number (25027816943628).
Almost surely, 2100111112010211 is an apocalyptic number.
100111112010211 is a deficient number, since it is larger than the sum of its proper divisors (155764301).
100111112010211 is an equidigital number, since it uses as much as digits as its factorization.
100111112010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155764300.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 100111112010211 its reverse (112010211111001), we get a palindrome (212121323121212).
The spelling of 100111112010211 in words is "one hundred trillion, one hundred eleven billion, one hundred twelve million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •