Base | Representation |
---|---|
bin | 100001000000010… |
… | …1000001000000101 |
3 | 2212011212211100202 |
4 | 1002000220020011 |
5 | 4232002214423 |
6 | 301520420245 |
7 | 36305155100 |
oct | 10200501005 |
9 | 2764784322 |
10 | 1107460613 |
11 | 519150606 |
12 | 26aa77685 |
13 | 14859374c |
14 | a7121737 |
15 | 6735b728 |
hex | 42028205 |
1107460613 has 12 divisors (see below), whose sum is σ = 1332695340. Its totient is φ = 916517952.
The previous prime is 1107460609. The next prime is 1107460639. The reversal of 1107460613 is 3160647011.
It can be written as a sum of positive squares in 2 ways, for example, as 352200289 + 755260324 = 18767^2 + 27482^2 .
It is not a de Polignac number, because 1107460613 - 22 = 1107460609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107460663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 388256 + ... + 391097.
It is an arithmetic number, because the mean of its divisors is an integer number (111057945).
Almost surely, 21107460613 is an apocalyptic number.
It is an amenable number.
1107460613 is a deficient number, since it is larger than the sum of its proper divisors (225234727).
1107460613 is an equidigital number, since it uses as much as digits as its factorization.
1107460613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 779396 (or 779389 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 1107460613 is about 33278.5308119214. The cubic root of 1107460613 is about 1034.6086295174.
The spelling of 1107460613 in words is "one billion, one hundred seven million, four hundred sixty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •