Base | Representation |
---|---|
bin | 11000000100101110010… |
… | …10110100011000001101 |
3 | 2221002001220010111112201 |
4 | 30002113022310120031 |
5 | 102023020444311204 |
6 | 1431555134001501 |
7 | 113522020165243 |
oct | 14022712643015 |
9 | 2832056114481 |
10 | 827169916429 |
11 | 29988994308a |
12 | 114389646291 |
13 | 60003c104bc |
14 | 2c06c998793 |
15 | 167b373c9a4 |
hex | c0972b460d |
827169916429 has 2 divisors, whose sum is σ = 827169916430. Its totient is φ = 827169916428.
The previous prime is 827169916427. The next prime is 827169916457. The reversal of 827169916429 is 924619961728.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 664339104900 + 162830811529 = 815070^2 + 403523^2 .
It is a cyclic number.
It is not a de Polignac number, because 827169916429 - 21 = 827169916427 is a prime.
It is a super-2 number, since 2×8271699164292 (a number of 25 digits) contains 22 as substring.
Together with 827169916427, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (827169916427) 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 as a sum of consecutive naturals, namely, 413584958214 + 413584958215.
It is an arithmetic number, because the mean of its divisors is an integer number (413584958215).
Almost surely, 2827169916429 is an apocalyptic number.
It is an amenable number.
827169916429 is a deficient number, since it is larger than the sum of its proper divisors (1).
827169916429 is an equidigital number, since it uses as much as digits as its factorization.
827169916429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23514624, while the sum is 64.
The spelling of 827169916429 in words is "eight hundred twenty-seven billion, one hundred sixty-nine million, nine hundred sixteen thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.218 sec. • engine limits •