Base | Representation |
---|---|
bin | 1111001100011001010… |
… | …10101100101001001001 |
3 | 1211220111122010220121111 |
4 | 13212030222230221021 |
5 | 32023130031432321 |
6 | 1035454341410321 |
7 | 52500624450154 |
oct | 7461452545111 |
9 | 1756448126544 |
10 | 522051045961 |
11 | 191445229725 |
12 | 85215a099a1 |
13 | 3a2c9733273 |
14 | 1b3a5a90c9b |
15 | d8a69965e1 |
hex | 798caaca49 |
522051045961 has 9 divisors (see below), whose sum is σ = 533429543271. Its totient is φ = 510910340472.
The previous prime is 522051045953. The next prime is 522051045983. The reversal of 522051045961 is 169540150225.
The square root of 522051045961 is 722531.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 8185725625 + 513865320336 = 90475^2 + 716844^2 .
It is not a de Polignac number, because 522051045961 - 23 = 522051045953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (522051045911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 33951271 + ... + 33966643.
Almost surely, 2522051045961 is an apocalyptic number.
522051045961 is the 722531-st square number.
522051045961 is the 361266-th centered octagonal number.
It is an amenable number.
522051045961 is a deficient number, since it is larger than the sum of its proper divisors (11378497310).
522051045961 is an frugal number, since it uses more digits than its factorization.
522051045961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30840 (or 15420 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 522051045961 in words is "five hundred twenty-two billion, fifty-one million, forty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •