Base | Representation |
---|---|
bin | 1110111010000011010… |
… | …11111011100110110001 |
3 | 1210222002022120122020001 |
4 | 13131001223323212301 |
5 | 31342443001043401 |
6 | 1031145230550001 |
7 | 52001604612442 |
oct | 7350153734661 |
9 | 1728068518201 |
10 | 512203143601 |
11 | 188251359946 |
12 | 83327968301 |
13 | 393ba3ca6c6 |
14 | 1ab0dc012c9 |
15 | d4cc12e601 |
hex | 7741afb9b1 |
512203143601 has 2 divisors, whose sum is σ = 512203143602. Its totient is φ = 512203143600.
The previous prime is 512203143497. The next prime is 512203143619. The reversal of 512203143601 is 106341302215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 402228666225 + 109974477376 = 634215^2 + 331624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-512203143601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 512203143601.
It is not a weakly prime, because it can be changed into another prime (512203113601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256101571800 + 256101571801.
It is an arithmetic number, because the mean of its divisors is an integer number (256101571801).
Almost surely, 2512203143601 is an apocalyptic number.
It is an amenable number.
512203143601 is a deficient number, since it is larger than the sum of its proper divisors (1).
512203143601 is an equidigital number, since it uses as much as digits as its factorization.
512203143601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 512203143601 its reverse (106341302215), we get a palindrome (618544445816).
The spelling of 512203143601 in words is "five hundred twelve billion, two hundred three million, one hundred forty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •