Base | Representation |
---|---|
bin | 1111001001000101010… |
… | …11011111010100111101 |
3 | 1211201220201012010221021 |
4 | 13210202223133110331 |
5 | 32011004323244134 |
6 | 1035002101104141 |
7 | 52405563262621 |
oct | 7444253372475 |
9 | 1751821163837 |
10 | 520272868669 |
11 | 19071251a814 |
12 | 849ba3b8051 |
13 | 3a0a5214158 |
14 | 1b277859181 |
15 | d8007ee0b4 |
hex | 7922adf53d |
520272868669 has 2 divisors, whose sum is σ = 520272868670. Its totient is φ = 520272868668.
The previous prime is 520272868667. The next prime is 520272868733. The reversal of 520272868669 is 966868272025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 520021265625 + 251603044 = 721125^2 + 15862^2 .
It is a cyclic number.
It is not a de Polignac number, because 520272868669 - 21 = 520272868667 is a prime.
It is a super-2 number, since 2×5202728686692 (a number of 24 digits) contains 22 as substring.
Together with 520272868667, 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 (520272868667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 260136434334 + 260136434335.
It is an arithmetic number, because the mean of its divisors is an integer number (260136434335).
Almost surely, 2520272868669 is an apocalyptic number.
It is an amenable number.
520272868669 is a deficient number, since it is larger than the sum of its proper divisors (1).
520272868669 is an equidigital number, since it uses as much as digits as its factorization.
520272868669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34836480, while the sum is 61.
The spelling of 520272868669 in words is "five hundred twenty billion, two hundred seventy-two million, eight hundred sixty-eight thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •