Base | Representation |
---|---|
bin | 111010011100111001100101… |
… | …1001100001001110111010101 |
3 | 2111102102211000201202102002222 |
4 | 1310321303023030021313111 |
5 | 1014342224141112434144 |
6 | 5021255040454112125 |
7 | 213203530112364203 |
oct | 16471631314116725 |
9 | 2442384021672088 |
10 | 514145354030549 |
11 | 139905902676a2a |
12 | 497b899294b645 |
13 | 190b69114a3127 |
14 | 90d6aa7214073 |
15 | 3e691795a72ee |
hex | 1d39ccb309dd5 |
514145354030549 has 2 divisors, whose sum is σ = 514145354030550. Its totient is φ = 514145354030548.
The previous prime is 514145354030543. The next prime is 514145354030573. The reversal of 514145354030549 is 945030453541415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 426041881571524 + 88103472459025 = 20640782^2 + 9386345^2 .
It is a cyclic number.
It is not a de Polignac number, because 514145354030549 - 28 = 514145354030293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 514145354030549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (514145354030543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 257072677015274 + 257072677015275.
It is an arithmetic number, because the mean of its divisors is an integer number (257072677015275).
Almost surely, 2514145354030549 is an apocalyptic number.
It is an amenable number.
514145354030549 is a deficient number, since it is larger than the sum of its proper divisors (1).
514145354030549 is an equidigital number, since it uses as much as digits as its factorization.
514145354030549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960000, while the sum is 53.
The spelling of 514145354030549 in words is "five hundred fourteen trillion, one hundred forty-five billion, three hundred fifty-four million, thirty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •