Base | Representation |
---|---|
bin | 110001011111110010… |
… | …0000101000101011101 |
3 | 101011100202021000212002 |
4 | 1202333210011011131 |
5 | 3220142014340443 |
6 | 120455210252045 |
7 | 10452020424065 |
oct | 1427744050535 |
9 | 334322230762 |
10 | 106293121373 |
11 | 4109577235a |
12 | 18725427025 |
13 | a03c5383ba |
14 | 5204b723a5 |
15 | 2b719732b8 |
hex | 18bf90515d |
106293121373 has 2 divisors, whose sum is σ = 106293121374. Its totient is φ = 106293121372.
The previous prime is 106293121349. The next prime is 106293121453. The reversal of 106293121373 is 373121392601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64619165209 + 41673956164 = 254203^2 + 204142^2 .
It is a cyclic number.
It is not a de Polignac number, because 106293121373 - 26 = 106293121309 is a prime.
It is a super-2 number, since 2×1062931213732 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106293121313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53146560686 + 53146560687.
It is an arithmetic number, because the mean of its divisors is an integer number (53146560687).
Almost surely, 2106293121373 is an apocalyptic number.
It is an amenable number.
106293121373 is a deficient number, since it is larger than the sum of its proper divisors (1).
106293121373 is an equidigital number, since it uses as much as digits as its factorization.
106293121373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 38.
The spelling of 106293121373 in words is "one hundred six billion, two hundred ninety-three million, one hundred twenty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •