Base | Representation |
---|---|
bin | 110001101010100011… |
… | …0111110010110010001 |
3 | 101012021221102120002002 |
4 | 1203111012332112101 |
5 | 3221412033342403 |
6 | 120555122003345 |
7 | 10464000026363 |
oct | 1432506762621 |
9 | 335257376062 |
10 | 106654590353 |
11 | 41260810353 |
12 | 188064a6555 |
13 | a0993a897c |
14 | 523ab86d33 |
15 | 2b93575188 |
hex | 18d51be591 |
106654590353 has 2 divisors, whose sum is σ = 106654590354. Its totient is φ = 106654590352.
The previous prime is 106654590331. The next prime is 106654590391. The reversal of 106654590353 is 353095456601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92624661649 + 14029928704 = 304343^2 + 118448^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106654590353 is a prime.
It is a super-2 number, since 2×1066545903532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106654590298 and 106654590307.
It is not a weakly prime, because it can be changed into another prime (106654590313) 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, 53327295176 + 53327295177.
It is an arithmetic number, because the mean of its divisors is an integer number (53327295177).
Almost surely, 2106654590353 is an apocalyptic number.
It is an amenable number.
106654590353 is a deficient number, since it is larger than the sum of its proper divisors (1).
106654590353 is an equidigital number, since it uses as much as digits as its factorization.
106654590353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458000, while the sum is 47.
The spelling of 106654590353 in words is "one hundred six billion, six hundred fifty-four million, five hundred ninety thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •