Base | Representation |
---|---|
bin | 10111000000101010111110… |
… | …110010000001010110010111 |
3 | 111021022202001001001211121121 |
4 | 113000222332302001112113 |
5 | 101231040044333241434 |
6 | 555123110532424411 |
7 | 30213355402365106 |
oct | 2700527662012627 |
9 | 437282031054547 |
10 | 101201220212119 |
11 | 2a278218554735 |
12 | b425583a78107 |
13 | 4461307480c51 |
14 | 1adc24540c03d |
15 | ba77216897b4 |
hex | 5c0abec81597 |
101201220212119 has 2 divisors, whose sum is σ = 101201220212120. Its totient is φ = 101201220212118.
The previous prime is 101201220212051. The next prime is 101201220212137. The reversal of 101201220212119 is 911212022102101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101201220212119 - 27 = 101201220211991 is a prime.
It is a super-2 number, since 2×1012012202121192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101201220212093 and 101201220212102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101201220215119) 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, 50600610106059 + 50600610106060.
It is an arithmetic number, because the mean of its divisors is an integer number (50600610106060).
Almost surely, 2101201220212119 is an apocalyptic number.
101201220212119 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201220212119 is an equidigital number, since it uses as much as digits as its factorization.
101201220212119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 101201220212119 in words is "one hundred one trillion, two hundred one billion, two hundred twenty million, two hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •