Base | Representation |
---|---|
bin | 1110111101101010100… |
… | …00101101110010111001 |
3 | 1211011002110012012011220 |
4 | 13132311100231302321 |
5 | 31410430343304301 |
6 | 1032105454542253 |
7 | 52100631206526 |
oct | 7366520556271 |
9 | 1734073165156 |
10 | 514142166201 |
11 | 189056938264 |
12 | 83789207989 |
13 | 39639044c61 |
14 | 1ac5554614d |
15 | d592499936 |
hex | 77b542dcb9 |
514142166201 has 4 divisors (see below), whose sum is σ = 685522888272. Its totient is φ = 342761444132.
The previous prime is 514142166169. The next prime is 514142166233. The reversal of 514142166201 is 102661241415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (514142166169) and next prime (514142166233).
It is a cyclic number.
It is not a de Polignac number, because 514142166201 - 25 = 514142166169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (514142166281) 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, 85690361031 + ... + 85690361036.
It is an arithmetic number, because the mean of its divisors is an integer number (171380722068).
Almost surely, 2514142166201 is an apocalyptic number.
It is an amenable number.
514142166201 is a deficient number, since it is larger than the sum of its proper divisors (171380722071).
514142166201 is a wasteful number, since it uses less digits than its factorization.
514142166201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171380722070.
The product of its (nonzero) digits is 11520, while the sum is 33.
The spelling of 514142166201 in words is "five hundred fourteen billion, one hundred forty-two million, one hundred sixty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •