Base | Representation |
---|---|
bin | 1111001010100100010… |
… | …11001001010101000001 |
3 | 1211210222020120011222112 |
4 | 13211102023021111001 |
5 | 32014122320240241 |
6 | 1035213123545105 |
7 | 52434410224406 |
oct | 7452213112501 |
9 | 1753866504875 |
10 | 521069696321 |
11 | 190a91294169 |
12 | 84ba122b195 |
13 | 3a1a13260c5 |
14 | 1b3115da2ad |
15 | d84a74b1eb |
hex | 79522c9541 |
521069696321 has 12 divisors (see below), whose sum is σ = 556116934500. Its totient is φ = 488098372608.
The previous prime is 521069696317. The next prime is 521069696351. The reversal of 521069696321 is 123696960125.
It can be written as a sum of positive squares in 2 ways, for example, as 359112547600 + 161957148721 = 599260^2 + 402439^2 .
It is not a de Polignac number, because 521069696321 - 22 = 521069696317 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 521069696321.
It is not an unprimeable number, because it can be changed into a prime (521069696351) 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 11 ways as a sum of consecutive naturals, for example, 8076896 + ... + 8141153.
It is an arithmetic number, because the mean of its divisors is an integer number (46343077875).
Almost surely, 2521069696321 is an apocalyptic number.
It is an amenable number.
521069696321 is a deficient number, since it is larger than the sum of its proper divisors (35047238179).
521069696321 is a wasteful number, since it uses less digits than its factorization.
521069696321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16218176 (or 16218157 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 50.
The spelling of 521069696321 in words is "five hundred twenty-one billion, sixty-nine million, six hundred ninety-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •