Base | Representation |
---|---|
bin | 110000111001011011… |
… | …0100001100101100001 |
3 | 101001001001112010121221 |
4 | 1201302312201211201 |
5 | 3210023031023243 |
6 | 120123353215041 |
7 | 10405102134343 |
oct | 1416266414541 |
9 | 331031463557 |
10 | 105006111073 |
11 | 40595237486 |
12 | 18426401481 |
13 | 9b959caa46 |
14 | 5121c73293 |
15 | 2ae899bbed |
hex | 1872da1961 |
105006111073 has 2 divisors, whose sum is σ = 105006111074. Its totient is φ = 105006111072.
The previous prime is 105006111013. The next prime is 105006111109. The reversal of 105006111073 is 370111600501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83040796224 + 21965314849 = 288168^2 + 148207^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105006111073 is a prime.
It is a super-2 number, since 2×1050061110732 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105006111013) 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, 52503055536 + 52503055537.
It is an arithmetic number, because the mean of its divisors is an integer number (52503055537).
Almost surely, 2105006111073 is an apocalyptic number.
It is an amenable number.
105006111073 is a deficient number, since it is larger than the sum of its proper divisors (1).
105006111073 is an equidigital number, since it uses as much as digits as its factorization.
105006111073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 25.
Adding to 105006111073 its reverse (370111600501), we get a palindrome (475117711574).
The spelling of 105006111073 in words is "one hundred five billion, six million, one hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •