Base | Representation |
---|---|
bin | 1110111101101010110… |
… | …10000001000010110101 |
3 | 1211011002121210001200101 |
4 | 13132311122001002311 |
5 | 31410432004314331 |
6 | 1032110023114101 |
7 | 52100661013024 |
oct | 7366532010265 |
9 | 1734077701611 |
10 | 514144604341 |
11 | 189058253055 |
12 | 83789ba2931 |
13 | 396396b9944 |
14 | 1ac559bc8bb |
15 | d5927cc061 |
hex | 77b56810b5 |
514144604341 has 8 divisors (see below), whose sum is σ = 528870140568. Its totient is φ = 499523136000.
The previous prime is 514144604333. The next prime is 514144604353. The reversal of 514144604341 is 143406441415.
It can be written as a sum of positive squares in 4 ways, for example, as 142679952900 + 371464651441 = 377730^2 + 609479^2 .
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 514144604341 - 23 = 514144604333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 514144604341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514144602341) 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, 26006950 + ... + 26026711.
It is an arithmetic number, because the mean of its divisors is an integer number (66108767571).
Almost surely, 2514144604341 is an apocalyptic number.
It is an amenable number.
514144604341 is a deficient number, since it is larger than the sum of its proper divisors (14725536227).
514144604341 is a wasteful number, since it uses less digits than its factorization.
514144604341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52033943.
The product of its (nonzero) digits is 92160, while the sum is 37.
The spelling of 514144604341 in words is "five hundred fourteen billion, one hundred forty-four million, six hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •