Base | Representation |
---|---|
bin | 110000010011111100101… |
… | …1111010010000000001001 |
3 | 212111202202202110210111021 |
4 | 1200213321133102000021 |
5 | 1332242014002334210 |
6 | 22042155503232441 |
7 | 1253501110314325 |
oct | 140477137220011 |
9 | 25452682423437 |
10 | 6639910199305 |
11 | 212aa74229439 |
12 | 8b2a385a8721 |
13 | 3921aa58a546 |
14 | 18d532746985 |
15 | b7abc99ebda |
hex | 609f97d2009 |
6639910199305 has 8 divisors (see below), whose sum is σ = 8002686529800. Its totient is φ = 5288731965696.
The previous prime is 6639910199267. The next prime is 6639910199311. The reversal of 6639910199305 is 5039910199366.
It can be written as a sum of positive squares in 4 ways, for example, as 792591356176 + 5847318843129 = 890276^2 + 2418123^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 6639910199305 - 219 = 6639909675017 is a prime.
It is an unprimeable number.
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, 2899522960 + ... + 2899525249.
It is an arithmetic number, because the mean of its divisors is an integer number (1000335816225).
Almost surely, 26639910199305 is an apocalyptic number.
It is an amenable number.
6639910199305 is a deficient number, since it is larger than the sum of its proper divisors (1362776330495).
6639910199305 is a wasteful number, since it uses less digits than its factorization.
6639910199305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5799048443.
The product of its (nonzero) digits is 10628820, while the sum is 61.
Adding to 6639910199305 its sum of digits (61), we get a palindrome (6639910199366).
The spelling of 6639910199305 in words is "six trillion, six hundred thirty-nine billion, nine hundred ten million, one hundred ninety-nine thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •