Base | Representation |
---|---|
bin | 1110111110000101000… |
… | …00110111001110101001 |
3 | 1211011122221120001212102 |
4 | 13133002200313032221 |
5 | 31411404303043303 |
6 | 1032143520223145 |
7 | 52106301064610 |
oct | 7370240671651 |
9 | 1734587501772 |
10 | 514364502953 |
11 | 189160397144 |
12 | 8382b76aab5 |
13 | 39673120172 |
14 | 1ac76ca0877 |
15 | d5a6c67288 |
hex | 77c28373a9 |
514364502953 has 4 divisors (see below), whose sum is σ = 587845146240. Its totient is φ = 440883859668.
The previous prime is 514364502947. The next prime is 514364502961. The reversal of 514364502953 is 359205463415.
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, and also an emirpimes, since its reverse is a distinct semiprime: 359205463415 = 5 ⋅71841092683.
It is not a de Polignac number, because 514364502953 - 214 = 514364486569 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 514364502898 and 514364502907.
It is not an unprimeable number, because it can be changed into a prime (514364502923) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36740321633 + ... + 36740321646.
It is an arithmetic number, because the mean of its divisors is an integer number (146961286560).
Almost surely, 2514364502953 is an apocalyptic number.
It is an amenable number.
514364502953 is a deficient number, since it is larger than the sum of its proper divisors (73480643287).
514364502953 is an equidigital number, since it uses as much as digits as its factorization.
514364502953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73480643286.
The product of its (nonzero) digits is 1944000, while the sum is 47.
The spelling of 514364502953 in words is "five hundred fourteen billion, three hundred sixty-four million, five hundred two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •