Base | Representation |
---|---|
bin | 10110111011010001… |
… | …11001100001001111 |
3 | 1011202210110112222212 |
4 | 23131220321201033 |
5 | 200201423430222 |
6 | 5353204101035 |
7 | 614004564263 |
oct | 133550714117 |
9 | 34683415885 |
10 | 12308420687 |
11 | 5246867702 |
12 | 247609477b |
13 | 1212020384 |
14 | 84a9840a3 |
15 | 4c08946e2 |
hex | 2dda3984f |
12308420687 has 4 divisors (see below), whose sum is σ = 12311882640. Its totient is φ = 12304958736.
The previous prime is 12308420681. The next prime is 12308420693. The reversal of 12308420687 is 78602480321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 78602480321 = 17 ⋅4623675313.
It is an interprime number because it is at equal distance from previous prime (12308420681) and next prime (12308420693).
It is a cyclic number.
It is not a de Polignac number, because 12308420687 - 26 = 12308420623 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12308420681) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1725638 + ... + 1732755.
It is an arithmetic number, because the mean of its divisors is an integer number (3077970660).
Almost surely, 212308420687 is an apocalyptic number.
12308420687 is a deficient number, since it is larger than the sum of its proper divisors (3461953).
12308420687 is an equidigital number, since it uses as much as digits as its factorization.
12308420687 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3461952.
The product of its (nonzero) digits is 129024, while the sum is 41.
The spelling of 12308420687 in words is "twelve billion, three hundred eight million, four hundred twenty thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •