Base | Representation |
---|---|
bin | 1110111010101011001… |
… | …00000000010101010100 |
3 | 1210222221120001111022022 |
4 | 13131111210000111110 |
5 | 31344133333011012 |
6 | 1031242302152312 |
7 | 52013064206201 |
oct | 7352544002524 |
9 | 1728846044268 |
10 | 512536610132 |
11 | 188402611218 |
12 | 833bb582698 |
13 | 39441515291 |
14 | 1ab42206ca8 |
15 | d4eb54e472 |
hex | 7755900554 |
512536610132 has 12 divisors (see below), whose sum is σ = 900429104820. Its totient is φ = 255271151616.
The previous prime is 512536610099. The next prime is 512536610153. The reversal of 512536610132 is 231016635215.
It can be written as a sum of positive squares in 2 ways, for example, as 463592127376 + 48944482756 = 680876^2 + 221234^2 .
It is a junction number, because it is equal to n+sod(n) for n = 512536610092 and 512536610101.
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 3 ways as a sum of consecutive naturals, for example, 249287207 + ... + 249289262.
It is an arithmetic number, because the mean of its divisors is an integer number (75035758735).
Almost surely, 2512536610132 is an apocalyptic number.
It is an amenable number.
512536610132 is a deficient number, since it is larger than the sum of its proper divisors (387892494688).
512536610132 is a wasteful number, since it uses less digits than its factorization.
512536610132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498576730 (or 498576728 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 512536610132 in words is "five hundred twelve billion, five hundred thirty-six million, six hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •