Base | Representation |
---|---|
bin | 110000100001111101110… |
… | …1001001000011100100001 |
3 | 212121122110112122100100022 |
4 | 1201003323221020130201 |
5 | 1333240140320411410 |
6 | 22104054422203225 |
7 | 1255615043646113 |
oct | 141037351103441 |
9 | 25548415570308 |
10 | 6670011107105 |
11 | 2141810423a45 |
12 | 8b8839283515 |
13 | 394c968233a8 |
14 | 190b8a33b3b3 |
15 | b87803ac455 |
hex | 610fba48721 |
6670011107105 has 8 divisors (see below), whose sum is σ = 8004130225512. Its totient is φ = 5335930954368.
The previous prime is 6670011107101. The next prime is 6670011107147. The reversal of 6670011107105 is 5017011100766.
It can be written as a sum of positive squares in 4 ways, for example, as 1109771650849 + 5560239456256 = 1053457^2 + 2358016^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 6670011107105 - 22 = 6670011107101 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6670011107101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9363494 + ... + 10050623.
It is an arithmetic number, because the mean of its divisors is an integer number (1000516278189).
Almost surely, 26670011107105 is an apocalyptic number.
It is an amenable number.
6670011107105 is a deficient number, since it is larger than the sum of its proper divisors (1334119118407).
6670011107105 is a wasteful number, since it uses less digits than its factorization.
6670011107105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19482835.
The product of its (nonzero) digits is 8820, while the sum is 35.
The spelling of 6670011107105 in words is "six trillion, six hundred seventy billion, eleven million, one hundred seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •