Base | Representation |
---|---|
bin | 111010001110001011111010… |
… | …0111000110111100001010011 |
3 | 2111011021111022001020002100011 |
4 | 1310130113310320313201103 |
5 | 1014111111124222140311 |
6 | 5013110040522535351 |
7 | 212604450266045464 |
oct | 16434276470674123 |
9 | 2434244261202304 |
10 | 512123124021331 |
11 | 1391a62195401a9 |
12 | 49530a86067557 |
13 | 18c9b007556564 |
14 | 9066c6a22cd6b |
15 | 3e3176ebb5321 |
hex | 1d1c5f4e37853 |
512123124021331 has 2 divisors, whose sum is σ = 512123124021332. Its totient is φ = 512123124021330.
The previous prime is 512123124021323. The next prime is 512123124021437. The reversal of 512123124021331 is 133120421321215.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 512123124021331 - 23 = 512123124021323 is a prime.
It is a super-2 number, since 2×5121231240213312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 512123124021293 and 512123124021302.
It is not a weakly prime, because it can be changed into another prime (512123124024331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256061562010665 + 256061562010666.
It is an arithmetic number, because the mean of its divisors is an integer number (256061562010666).
Almost surely, 2512123124021331 is an apocalyptic number.
512123124021331 is a deficient number, since it is larger than the sum of its proper divisors (1).
512123124021331 is an equidigital number, since it uses as much as digits as its factorization.
512123124021331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 512123124021331 its reverse (133120421321215), we get a palindrome (645243545342546).
The spelling of 512123124021331 in words is "five hundred twelve trillion, one hundred twenty-three billion, one hundred twenty-four million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •