Base | Representation |
---|---|
bin | 10110110000110100101011… |
… | …011010001111000100010011 |
3 | 111010110121212211202110222011 |
4 | 112300310223122033010103 |
5 | 101110214110434001321 |
6 | 552530512400523351 |
7 | 30041601454002625 |
oct | 2660645332170423 |
9 | 433417784673864 |
10 | 100112121000211 |
11 | 29998348429121 |
12 | b28a496920557 |
13 | 43b26bcba4458 |
14 | 1aa164998ac15 |
15 | b8922cbcbae1 |
hex | 5b0d2b68f113 |
100112121000211 has 2 divisors, whose sum is σ = 100112121000212. Its totient is φ = 100112121000210.
The previous prime is 100112121000187. The next prime is 100112121000271. The reversal of 100112121000211 is 112000121211001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100112121000211 - 25 = 100112121000179 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100112121000191 and 100112121000200.
It is not a weakly prime, because it can be changed into another prime (100112121000271) 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 as a sum of consecutive naturals, namely, 50056060500105 + 50056060500106.
It is an arithmetic number, because the mean of its divisors is an integer number (50056060500106).
Almost surely, 2100112121000211 is an apocalyptic number.
100112121000211 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112121000211 is an equidigital number, since it uses as much as digits as its factorization.
100112121000211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100112121000211 its reverse (112000121211001), we get a palindrome (212112242211212).
The spelling of 100112121000211 in words is "one hundred trillion, one hundred twelve billion, one hundred twenty-one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •