Base | Representation |
---|---|
bin | 10111001101110100… |
… | …10001000110100101 |
3 | 1012011122011012201112 |
4 | 23212322101012211 |
5 | 201011233444202 |
6 | 5420442034405 |
7 | 620603662046 |
oct | 134672210645 |
9 | 35148135645 |
10 | 12463968677 |
11 | 5316649166 |
12 | 24ba1a8a05 |
13 | 12383125c4 |
14 | 8634b48cd |
15 | 4ce36cb52 |
hex | 2e6e911a5 |
12463968677 has 4 divisors (see below), whose sum is σ = 12518876256. Its totient is φ = 12409061100.
The previous prime is 12463968653. The next prime is 12463968683. The reversal of 12463968677 is 77686936421.
12463968677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 12463968677 - 218 = 12463706533 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 (12463968277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27453449 + ... + 27453902.
It is an arithmetic number, because the mean of its divisors is an integer number (3129719064).
Almost surely, 212463968677 is an apocalyptic number.
It is an amenable number.
12463968677 is a deficient number, since it is larger than the sum of its proper divisors (54907579).
12463968677 is an equidigital number, since it uses as much as digits as its factorization.
12463968677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54907578.
The product of its digits is 18289152, while the sum is 59.
The spelling of 12463968677 in words is "twelve billion, four hundred sixty-three million, nine hundred sixty-eight thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •