Base | Representation |
---|---|
bin | 110001101011111000… |
… | …0100011010111000101 |
3 | 101012102001002001102022 |
4 | 1203113300203113011 |
5 | 3222004423404133 |
6 | 121003350452525 |
7 | 10465046624612 |
oct | 1432760432705 |
9 | 335361061368 |
10 | 106699044293 |
11 | 41283913246 |
12 | 18819364145 |
13 | a0a567188a |
14 | 5242a39509 |
15 | 2b97406998 |
hex | 18d7c235c5 |
106699044293 has 2 divisors, whose sum is σ = 106699044294. Its totient is φ = 106699044292.
The previous prime is 106699044247. The next prime is 106699044299. The reversal of 106699044293 is 392440996601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105224330689 + 1474713604 = 324383^2 + 38402^2 .
It is a cyclic number.
It is not a de Polignac number, because 106699044293 - 218 = 106698782149 is a prime.
It is a super-2 number, since 2×1066990442932 (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 (106699044299) 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, 53349522146 + 53349522147.
It is an arithmetic number, because the mean of its divisors is an integer number (53349522147).
Almost surely, 2106699044293 is an apocalyptic number.
It is an amenable number.
106699044293 is a deficient number, since it is larger than the sum of its proper divisors (1).
106699044293 is an equidigital number, since it uses as much as digits as its factorization.
106699044293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2519424, while the sum is 53.
The spelling of 106699044293 in words is "one hundred six billion, six hundred ninety-nine million, forty-four thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •