Base | Representation |
---|---|
bin | 1110111110011000110… |
… | …01000110101001110111 |
3 | 1211012002111102102220220 |
4 | 13133030121012221313 |
5 | 31412224220204033 |
6 | 1032212200425423 |
7 | 52113352613412 |
oct | 7371431065167 |
9 | 1735074372826 |
10 | 514530241143 |
11 | 1892359a8756 |
12 | 83877178273 |
13 | 3969b56c6b9 |
14 | 1ac90cc4b79 |
15 | d5b65a4bb3 |
hex | 77cc646a77 |
514530241143 has 4 divisors (see below), whose sum is σ = 686040321528. Its totient is φ = 343020160760.
The previous prime is 514530241117. The next prime is 514530241151. The reversal of 514530241143 is 341142035415.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 514530241143 - 214 = 514530224759 is a prime.
It is a super-3 number, since 3×5145302411433 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514530241193) 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 in 3 ways as a sum of consecutive naturals, for example, 85755040188 + ... + 85755040193.
It is an arithmetic number, because the mean of its divisors is an integer number (171510080382).
Almost surely, 2514530241143 is an apocalyptic number.
514530241143 is a deficient number, since it is larger than the sum of its proper divisors (171510080385).
514530241143 is a wasteful number, since it uses less digits than its factorization.
514530241143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171510080384.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 514530241143 its reverse (341142035415), we get a palindrome (855672276558).
The spelling of 514530241143 in words is "five hundred fourteen billion, five hundred thirty million, two hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •