Base | Representation |
---|---|
bin | 1001001011100… |
… | …10011001100111 |
3 | 12100220202012202 |
4 | 10211302121213 |
5 | 124203432011 |
6 | 11350405115 |
7 | 1623420311 |
oct | 445623147 |
9 | 170822182 |
10 | 77014631 |
11 | 3a522261 |
12 | 2196079b |
13 | 12c565b5 |
14 | a32a7b1 |
15 | 6b6423b |
hex | 4972667 |
77014631 has 2 divisors, whose sum is σ = 77014632. Its totient is φ = 77014630.
The previous prime is 77014627. The next prime is 77014697. The reversal of 77014631 is 13641077.
It is a weak prime.
It is an emirp because it is prime and its reverse (13641077) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 77014631 - 22 = 77014627 is a prime.
It is a super-2 number, since 2×770146312 = 11862506776132322, which contains 22 as substring.
It is a Sophie Germain prime.
It is equal to p4505375 and since 77014631 and 4505375 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 77014594 and 77014603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (77014601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38507315 + 38507316.
It is an arithmetic number, because the mean of its divisors is an integer number (38507316).
Almost surely, 277014631 is an apocalyptic number.
77014631 is a deficient number, since it is larger than the sum of its proper divisors (1).
77014631 is an equidigital number, since it uses as much as digits as its factorization.
77014631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3528, while the sum is 29.
The square root of 77014631 is about 8775.7980263905. The cubic root of 77014631 is about 425.4590306788.
The spelling of 77014631 in words is "seventy-seven million, fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •