Base | Representation |
---|---|
bin | 101100111010101110000… |
… | …010110010101111000001 |
3 | 101221002022212211011000012 |
4 | 230322232002302233001 |
5 | 401033033330024314 |
6 | 10322002520234305 |
7 | 436002315141443 |
oct | 54725602625701 |
9 | 11832285734005 |
10 | 3086706486209 |
11 | a90079383145 |
12 | 41a28390b995 |
13 | 1950c9201248 |
14 | a957c626493 |
15 | 5545b89e93e |
hex | 2ceae0b2bc1 |
3086706486209 has 6 divisors (see below), whose sum is σ = 3278958101574. Its totient is φ = 2905135516160.
The previous prime is 3086706486197. The next prime is 3086706486263. The reversal of 3086706486209 is 9026846076803.
3086706486209 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 491256604609 + 2595449881600 = 700897^2 + 1611040^2 .
It is not a de Polignac number, because 3086706486209 - 228 = 3086438050753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3086706486709) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5340322352 + ... + 5340322929.
It is an arithmetic number, because the mean of its divisors is an integer number (546493016929).
Almost surely, 23086706486209 is an apocalyptic number.
It is an amenable number.
3086706486209 is a deficient number, since it is larger than the sum of its proper divisors (192251615365).
3086706486209 is a wasteful number, since it uses less digits than its factorization.
3086706486209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10680645315 (or 10680645298 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 59.
The spelling of 3086706486209 in words is "three trillion, eighty-six billion, seven hundred six million, four hundred eighty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •