Base | Representation |
---|---|
bin | 1100110100000… |
… | …11010011000001 |
3 | 21111021012001101 |
4 | 12122003103001 |
5 | 210004230140 |
6 | 14355534401 |
7 | 2443446226 |
oct | 632032301 |
9 | 244235041 |
10 | 107492545 |
11 | 55749816 |
12 | 2bbba401 |
13 | 19367c74 |
14 | 103c194d |
15 | 968499a |
hex | 66834c1 |
107492545 has 8 divisors (see below), whose sum is σ = 129046824. Its totient is φ = 85956864.
The previous prime is 107492527. The next prime is 107492549. The reversal of 107492545 is 545294701.
It can be written as a sum of positive squares in 4 ways, for example, as 3268864 + 104223681 = 1808^2 + 10209^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107492545 - 27 = 107492417 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107492549) 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, 19207 + ... + 24163.
It is an arithmetic number, because the mean of its divisors is an integer number (16130853).
Almost surely, 2107492545 is an apocalyptic number.
It is an amenable number.
107492545 is a deficient number, since it is larger than the sum of its proper divisors (21554279).
107492545 is an equidigital number, since it uses as much as digits as its factorization.
107492545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9299.
The product of its (nonzero) digits is 50400, while the sum is 37.
The square root of 107492545 is about 10367.8611584068. The cubic root of 107492545 is about 475.4732789717.
The spelling of 107492545 in words is "one hundred seven million, four hundred ninety-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •