Base | Representation |
---|---|
bin | 11110100001100… |
… | …001101010011001 |
3 | 1022200121122011001 |
4 | 132201201222121 |
5 | 2022044330423 |
6 | 122452105001 |
7 | 15455551552 |
oct | 3641415231 |
9 | 1280548131 |
10 | 512105113 |
11 | 243085173 |
12 | 123605161 |
13 | 82132ba0 |
14 | 4c027329 |
15 | 2ee59cad |
hex | 1e861a99 |
512105113 has 8 divisors (see below), whose sum is σ = 570515400. Its totient is φ = 456411648.
The previous prime is 512105101. The next prime is 512105117. The reversal of 512105113 is 311501215.
It can be written as a sum of positive squares in 4 ways, for example, as 119946304 + 392158809 = 10952^2 + 19803^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-512105113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (512105117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 678808 + ... + 679561.
It is an arithmetic number, because the mean of its divisors is an integer number (71314425).
Almost surely, 2512105113 is an apocalyptic number.
It is an amenable number.
512105113 is a deficient number, since it is larger than the sum of its proper divisors (58410287).
512105113 is a wasteful number, since it uses less digits than its factorization.
512105113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1358411.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 512105113 is about 22629.7395698669. The cubic root of 512105113 is about 800.0547426081.
Adding to 512105113 its reverse (311501215), we get a palindrome (823606328).
It can be divided in two parts, 512 and 105113, that added together give a square (105625 = 3252).
The spelling of 512105113 in words is "five hundred twelve million, one hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •