Base | Representation |
---|---|
bin | 1110111010010111101… |
… | …00001000011111000101 |
3 | 1210222112011022120110222 |
4 | 13131023310020133011 |
5 | 31343320001100134 |
6 | 1031214140554125 |
7 | 52006040125163 |
oct | 7351364103705 |
9 | 1728464276428 |
10 | 512373065669 |
11 | 188329268903 |
12 | 83374852945 |
13 | 394166833ca |
14 | 1ab285d4233 |
15 | d4dbee6a2e |
hex | 774bd087c5 |
512373065669 has 2 divisors, whose sum is σ = 512373065670. Its totient is φ = 512373065668.
The previous prime is 512373065639. The next prime is 512373065671. The reversal of 512373065669 is 966560373215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 501356044225 + 11017021444 = 708065^2 + 104962^2 .
It is a cyclic number.
It is not a de Polignac number, because 512373065669 - 232 = 508078098373 is a prime.
It is a super-2 number, since 2×5123730656692 (a number of 24 digits) contains 22 as substring.
Together with 512373065671, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 512373065669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (512373065639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256186532834 + 256186532835.
It is an arithmetic number, because the mean of its divisors is an integer number (256186532835).
Almost surely, 2512373065669 is an apocalyptic number.
It is an amenable number.
512373065669 is a deficient number, since it is larger than the sum of its proper divisors (1).
512373065669 is an equidigital number, since it uses as much as digits as its factorization.
512373065669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6123600, while the sum is 53.
The spelling of 512373065669 in words is "five hundred twelve billion, three hundred seventy-three million, sixty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •