Base | Representation |
---|---|
bin | 1100110000110… |
… | …00001001010101 |
3 | 21110102220000010 |
4 | 12120120021111 |
5 | 204401204103 |
6 | 14342310433 |
7 | 2436640530 |
oct | 630301125 |
9 | 243386003 |
10 | 107053653 |
11 | 55479aa3 |
12 | 2ba28419 |
13 | 19243275 |
14 | 10309a17 |
15 | 95e9903 |
hex | 6618255 |
107053653 has 8 divisors (see below), whose sum is σ = 163129408. Its totient is φ = 61173504.
The previous prime is 107053631. The next prime is 107053741. The reversal of 107053653 is 356350701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107053653 - 26 = 107053589 is a prime.
It is a super-2 number, since 2×1070536532 = 22920969241288818, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 107053653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107053853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2548876 + ... + 2548917.
It is an arithmetic number, because the mean of its divisors is an integer number (20391176).
Almost surely, 2107053653 is an apocalyptic number.
It is an amenable number.
107053653 is a deficient number, since it is larger than the sum of its proper divisors (56075755).
107053653 is an equidigital number, since it uses as much as digits as its factorization.
107053653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5097803.
The product of its (nonzero) digits is 9450, while the sum is 30.
The square root of 107053653 is about 10346.6735234084. The cubic root of 107053653 is about 474.8252771972.
The spelling of 107053653 in words is "one hundred seven million, fifty-three thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •