Base | Representation |
---|---|
bin | 10111011111101110… |
… | …10111000000100001 |
3 | 1012120002211211020121 |
4 | 23233313113000201 |
5 | 201313213421002 |
6 | 5443410040241 |
7 | 624406641211 |
oct | 135767270041 |
9 | 35502754217 |
10 | 12614201377 |
11 | 539342a218 |
12 | 2540579081 |
13 | 12604933ab |
14 | 879420241 |
15 | 4dc646237 |
hex | 2efdd7021 |
12614201377 has 4 divisors (see below), whose sum is σ = 12615115696. Its totient is φ = 12613287060.
The previous prime is 12614201339. The next prime is 12614201381. The reversal of 12614201377 is 77310241621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12614201377 is a prime.
It is a super-2 number, since 2×126142013772 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12614201387) 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, 436143 + ... + 464164.
It is an arithmetic number, because the mean of its divisors is an integer number (3153778924).
Almost surely, 212614201377 is an apocalyptic number.
It is an amenable number.
12614201377 is a deficient number, since it is larger than the sum of its proper divisors (914319).
12614201377 is an equidigital number, since it uses as much as digits as its factorization.
12614201377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914318.
The product of its (nonzero) digits is 14112, while the sum is 34.
Adding to 12614201377 its reverse (77310241621), we get a palindrome (89924442998).
The spelling of 12614201377 in words is "twelve billion, six hundred fourteen million, two hundred one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •