Base | Representation |
---|---|
bin | 1100111001110… |
… | …11001011000101 |
3 | 21112200110012001 |
4 | 12130323023011 |
5 | 210202330301 |
6 | 14424025301 |
7 | 2453034064 |
oct | 634731305 |
9 | 245613161 |
10 | 108245701 |
11 | 56113663 |
12 | 30302231 |
13 | 1956ca15 |
14 | 1053a1db |
15 | 9782c01 |
hex | 673b2c5 |
108245701 has 4 divisors (see below), whose sum is σ = 108389452. Its totient is φ = 108101952.
The previous prime is 108245689. The next prime is 108245723. The reversal of 108245701 is 107542801.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 107542801 = 6011 ⋅17891.
It can be written as a sum of positive squares in 2 ways, for example, as 77176225 + 31069476 = 8785^2 + 5574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-108245701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 108245701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108245741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 70740 + ... + 72253.
It is an arithmetic number, because the mean of its divisors is an integer number (27097363).
Almost surely, 2108245701 is an apocalyptic number.
It is an amenable number.
108245701 is a deficient number, since it is larger than the sum of its proper divisors (143751).
108245701 is an equidigital number, since it uses as much as digits as its factorization.
108245701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143750.
The product of its (nonzero) digits is 2240, while the sum is 28.
The square root of 108245701 is about 10404.1194245356. The cubic root of 108245701 is about 476.5811772832.
The spelling of 108245701 in words is "one hundred eight million, two hundred forty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •