Base | Representation |
---|---|
bin | 1111001011000100100… |
… | …10011011101110110100 |
3 | 1211211200002021011202112 |
4 | 13211202102123232310 |
5 | 32020201022322124 |
6 | 1035300022230152 |
7 | 52444202145614 |
oct | 7454222335664 |
9 | 1754602234675 |
10 | 521340042164 |
11 | 19110a953a87 |
12 | 85057885358 |
13 | 3a215340466 |
14 | 1b339490a44 |
15 | d86434d90e |
hex | 796249bbb4 |
521340042164 has 12 divisors (see below), whose sum is σ = 912369958500. Its totient is φ = 260662911168.
The previous prime is 521340042163. The next prime is 521340042169. The reversal of 521340042164 is 461240043125.
It can be written as a sum of positive squares in 2 ways, for example, as 56273328400 + 465066713764 = 237220^2 + 681958^2 .
It is a super-2 number, since 2×5213400421642 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 521340042164.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (521340042163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1610759 + ... + 1907150.
It is an arithmetic number, because the mean of its divisors is an integer number (76030829875).
Almost surely, 2521340042164 is an apocalyptic number.
It is an amenable number.
521340042164 is a deficient number, since it is larger than the sum of its proper divisors (391029916336).
521340042164 is a wasteful number, since it uses less digits than its factorization.
521340042164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3554962 (or 3554960 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 521340042164 its reverse (461240043125), we get a palindrome (982580085289).
The spelling of 521340042164 in words is "five hundred twenty-one billion, three hundred forty million, forty-two thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •