Base | Representation |
---|---|
bin | 111010001110010001111101… |
… | …1110011111001100010000101 |
3 | 2111011022201212002222100022021 |
4 | 1310130203323303321202011 |
5 | 1014111314241003430003 |
6 | 5013120030552203141 |
7 | 212605420414054120 |
oct | 16434437363714205 |
9 | 2434281762870267 |
10 | 512136125061253 |
11 | 1392007902659a0 |
12 | 495334b40994b1 |
13 | 18c9c2c9c006a4 |
14 | 9067740b893b7 |
15 | 3e31c812702bd |
hex | 1d1c8fbcf9885 |
512136125061253 has 8 divisors (see below), whose sum is σ = 638507376699840. Its totient is φ = 399067110437280.
The previous prime is 512136125061233. The next prime is 512136125061271. The reversal of 512136125061253 is 352160521631215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 512136125061253 - 29 = 512136125060741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (512136125061233) 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, 3325559253568 + ... + 3325559253721.
It is an arithmetic number, because the mean of its divisors is an integer number (79813422087480).
Almost surely, 2512136125061253 is an apocalyptic number.
It is an amenable number.
512136125061253 is a deficient number, since it is larger than the sum of its proper divisors (126371251638587).
512136125061253 is a wasteful number, since it uses less digits than its factorization.
512136125061253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6651118507307.
The product of its (nonzero) digits is 324000, while the sum is 43.
Adding to 512136125061253 its reverse (352160521631215), we get a palindrome (864296646692468).
The spelling of 512136125061253 in words is "five hundred twelve trillion, one hundred thirty-six billion, one hundred twenty-five million, sixty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •