Base | Representation |
---|---|
bin | 11110101001010… |
… | …001100100000011 |
3 | 1022211102211110001 |
4 | 132221101210003 |
5 | 2023104330243 |
6 | 123003420431 |
7 | 15512041501 |
oct | 3651214403 |
9 | 1284384401 |
10 | 514136323 |
11 | 244242258 |
12 | 124224717 |
13 | 8269459c |
14 | 4c3d5671 |
15 | 3020ba4d |
hex | 1ea51903 |
514136323 has 4 divisors (see below), whose sum is σ = 518853280. Its totient is φ = 509419368.
The previous prime is 514136309. The next prime is 514136339. The reversal of 514136323 is 323631415.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-514136323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 514136291 and 514136300.
It is not an unprimeable number, because it can be changed into a prime (514136303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2358315 + ... + 2358532.
It is an arithmetic number, because the mean of its divisors is an integer number (129713320).
Almost surely, 2514136323 is an apocalyptic number.
514136323 is a deficient number, since it is larger than the sum of its proper divisors (4716957).
514136323 is a wasteful number, since it uses less digits than its factorization.
514136323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4716956.
The product of its digits is 6480, while the sum is 28.
The square root of 514136323 is about 22674.5743730726. The cubic root of 514136323 is about 801.1111242683. Note that the first 4 decimals are identical.
Adding to 514136323 its reverse (323631415), we get a palindrome (837767738).
The spelling of 514136323 in words is "five hundred fourteen million, one hundred thirty-six thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •