Base | Representation |
---|---|
bin | 110000100010111100011… |
… | …0010011101110101010101 |
3 | 212121211212212102000120112 |
4 | 1201011320302131311111 |
5 | 1333303440320043010 |
6 | 22105043024012405 |
7 | 1256021060152523 |
oct | 141057062356525 |
9 | 25554785360515 |
10 | 6672110706005 |
11 | 2142698608748 |
12 | 8b9124461105 |
13 | 39523c8007c4 |
14 | 190d09121313 |
15 | b8854895a05 |
hex | 61178c9dd55 |
6672110706005 has 4 divisors (see below), whose sum is σ = 8006532847212. Its totient is φ = 5337688564800.
The previous prime is 6672110705959. The next prime is 6672110706007. The reversal of 6672110706005 is 5006070112766.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1453874058289 + 5218236647716 = 1205767^2 + 2284346^2 .
It is not a de Polignac number, because 6672110706005 - 212 = 6672110701909 is a prime.
It is a super-2 number, since 2×66721107060052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6672110706007) 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, 667211070596 + ... + 667211070605.
It is an arithmetic number, because the mean of its divisors is an integer number (2001633211803).
Almost surely, 26672110706005 is an apocalyptic number.
It is an amenable number.
6672110706005 is a deficient number, since it is larger than the sum of its proper divisors (1334422141207).
6672110706005 is a wasteful number, since it uses less digits than its factorization.
6672110706005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1334422141206.
The product of its (nonzero) digits is 105840, while the sum is 41.
The spelling of 6672110706005 in words is "six trillion, six hundred seventy-two billion, one hundred ten million, seven hundred six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •