Base | Representation |
---|---|
bin | 1011100011100100101011… |
… | …1111001101111011111001 |
3 | 1122222122211001101100020002 |
4 | 2320321022333031323321 |
5 | 3131132404431111310 |
6 | 43004541211242345 |
7 | 2450650600333442 |
oct | 270711277157371 |
9 | 48878731340202 |
10 | 12705771347705 |
11 | 405953a761447 |
12 | 15125691493b5 |
13 | 7121c2748867 |
14 | 31cd695b22c9 |
15 | 17078d9e6da5 |
hex | b8e4afcdef9 |
12705771347705 has 8 divisors (see below), whose sum is σ = 15250090878792. Its totient is φ = 10162506903808.
The previous prime is 12705771347663. The next prime is 12705771347771. The reversal of 12705771347705 is 50774317750721.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2182994430016 + 10522776917689 = 1477496^2 + 3243883^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 12705771347705 - 212 = 12705771343609 is a prime.
It is a super-2 number, since 2×127057713477052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263745302 + ... + 263793471.
It is an arithmetic number, because the mean of its divisors is an integer number (1906261359849).
Almost surely, 212705771347705 is an apocalyptic number.
It is an amenable number.
12705771347705 is a deficient number, since it is larger than the sum of its proper divisors (2544319531087).
12705771347705 is an equidigital number, since it uses as much as digits as its factorization.
12705771347705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527543595.
The product of its (nonzero) digits is 10084200, while the sum is 56.
The spelling of 12705771347705 in words is "twelve trillion, seven hundred five billion, seven hundred seventy-one million, three hundred forty-seven thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •