Base | Representation |
---|---|
bin | 1110111010000011001… |
… | …01001100001111000000 |
3 | 1210222002012020212111102 |
4 | 13131001211030033000 |
5 | 31342442023023304 |
6 | 1031145125033532 |
7 | 52001553603233 |
oct | 7350145141700 |
9 | 1728065225442 |
10 | 512201376704 |
11 | 1882503623a6 |
12 | 833272558a8 |
13 | 393b9c2c3c4 |
14 | 1ab0d8a141a |
15 | d4cbdd0d1e |
hex | 774194c3c0 |
512201376704 has 56 divisors (see below), whose sum is σ = 1044241873920. Its totient is φ = 249150584576.
The previous prime is 512201376697. The next prime is 512201376769. The reversal of 512201376704 is 407673102215.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 7484 + ... + 1012155.
It is an arithmetic number, because the mean of its divisors is an integer number (18647176320).
Almost surely, 2512201376704 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 512201376704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (522120936960).
512201376704 is an abundant number, since it is smaller than the sum of its proper divisors (532040497216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
512201376704 is a wasteful number, since it uses less digits than its factorization.
512201376704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019865 (or 1019855 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 38.
Adding to 512201376704 its reverse (407673102215), we get a palindrome (919874478919).
The spelling of 512201376704 in words is "five hundred twelve billion, two hundred one million, three hundred seventy-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •