Base | Representation |
---|---|
bin | 110001011010000011… |
… | …0011110011000100101 |
3 | 101010212100101200000211 |
4 | 1202310012132120211 |
5 | 3214243301430201 |
6 | 120424140335421 |
7 | 10444164005242 |
oct | 1426406363045 |
9 | 333770350024 |
10 | 106100811301 |
11 | 40aa7161a11 |
12 | 18690b44571 |
13 | a00b744364 |
14 | 51c73d25c9 |
15 | 2b5eb37651 |
hex | 18b419e625 |
106100811301 has 2 divisors, whose sum is σ = 106100811302. Its totient is φ = 106100811300.
The previous prime is 106100811263. The next prime is 106100811331. The reversal of 106100811301 is 103118001601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87930040900 + 18170770401 = 296530^2 + 134799^2 .
It is a cyclic number.
It is not a de Polignac number, because 106100811301 - 223 = 106092422693 is a prime.
It is a super-2 number, since 2×1061008113012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106100811331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53050405650 + 53050405651.
It is an arithmetic number, because the mean of its divisors is an integer number (53050405651).
Almost surely, 2106100811301 is an apocalyptic number.
It is an amenable number.
106100811301 is a deficient number, since it is larger than the sum of its proper divisors (1).
106100811301 is an equidigital number, since it uses as much as digits as its factorization.
106100811301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 106100811301 its reverse (103118001601), we get a palindrome (209218812902).
The spelling of 106100811301 in words is "one hundred six billion, one hundred million, eight hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •