Base | Representation |
---|---|
bin | 1011010000111101101110… |
… | …1110111001111110110101 |
3 | 1121212002122000111000012222 |
4 | 2310033123232321332311 |
5 | 3110413141232031124 |
6 | 42202030232452125 |
7 | 2415602353154336 |
oct | 264173356717665 |
9 | 47762560430188 |
10 | 12386077220789 |
11 | 3a459a67610a8 |
12 | 148060824a045 |
13 | 6bb00471841c |
14 | 30b6bca4a28d |
15 | 1672cc38b25e |
hex | b43dbbb9fb5 |
12386077220789 has 2 divisors, whose sum is σ = 12386077220790. Its totient is φ = 12386077220788.
The previous prime is 12386077220773. The next prime is 12386077220791. The reversal of 12386077220789 is 98702277068321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9239593708900 + 3146483511889 = 3039670^2 + 1773833^2 .
It is a cyclic number.
It is not a de Polignac number, because 12386077220789 - 24 = 12386077220773 is a prime.
Together with 12386077220791, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12386077223789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6193038610394 + 6193038610395.
It is an arithmetic number, because the mean of its divisors is an integer number (6193038610395).
Almost surely, 212386077220789 is an apocalyptic number.
It is an amenable number.
12386077220789 is a deficient number, since it is larger than the sum of its proper divisors (1).
12386077220789 is an equidigital number, since it uses as much as digits as its factorization.
12386077220789 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28449792, while the sum is 62.
The spelling of 12386077220789 in words is "twelve trillion, three hundred eighty-six billion, seventy-seven million, two hundred twenty thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •