Base | Representation |
---|---|
bin | 100000111111110… |
… | …1101001100001101 |
3 | 2212011102120020000 |
4 | 1001333231030031 |
5 | 4231422003323 |
6 | 301511314513 |
7 | 36303131232 |
oct | 10177551415 |
9 | 2764376200 |
10 | 1107219213 |
11 | 518aa6201 |
12 | 26a97ba39 |
13 | 14850a8c9 |
14 | a709b789 |
15 | 6730ee43 |
hex | 41fed30d |
1107219213 has 20 divisors (see below), whose sum is σ = 1655054940. Its totient is φ = 737672832.
The previous prime is 1107219199. The next prime is 1107219221. The reversal of 1107219213 is 3129127011.
It can be written as a sum of positive squares in 2 ways, for example, as 913369284 + 193849929 = 30222^2 + 13923^2 .
It is not a de Polignac number, because 1107219213 - 226 = 1040110349 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107219263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 160981 + ... + 167717.
It is an arithmetic number, because the mean of its divisors is an integer number (82752747).
Almost surely, 21107219213 is an apocalyptic number.
It is an amenable number.
1107219213 is a deficient number, since it is larger than the sum of its proper divisors (547835727).
1107219213 is an equidigital number, since it uses as much as digits as its factorization.
1107219213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8778 (or 8769 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 1107219213 is about 33274.9036512504. The cubic root of 1107219213 is about 1034.5334507197.
The spelling of 1107219213 in words is "one billion, one hundred seven million, two hundred nineteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •