Base | Representation |
---|---|
bin | 111010011100111001011011… |
… | …1010110001011010011000111 |
3 | 2111102102210011112022110211111 |
4 | 1310321302313112023103013 |
5 | 1014342223000401113133 |
6 | 5021254543442345451 |
7 | 213203515630546531 |
oct | 16471626726132307 |
9 | 2442383145273744 |
10 | 514145021113543 |
11 | 13990575175a506 |
12 | 497b88bb35b287 |
13 | 190b688a51b711 |
14 | 90d6a74d12851 |
15 | 3e6915a2451cd |
hex | 1d39cb758b4c7 |
514145021113543 has 16 divisors (see below), whose sum is σ = 515309950134720. Its totient is φ = 512981386444800.
The previous prime is 514145021113541. The next prime is 514145021113567. The reversal of 514145021113543 is 345311120541415.
It is a cyclic number.
It is not a de Polignac number, because 514145021113543 - 21 = 514145021113541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 514145021113496 and 514145021113505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (514145021113541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8106825973 + ... + 8106889393.
It is an arithmetic number, because the mean of its divisors is an integer number (32206871883420).
Almost surely, 2514145021113543 is an apocalyptic number.
514145021113543 is a deficient number, since it is larger than the sum of its proper divisors (1164929021177).
514145021113543 is a wasteful number, since it uses less digits than its factorization.
514145021113543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73338.
The product of its (nonzero) digits is 144000, while the sum is 40.
Adding to 514145021113543 its reverse (345311120541415), we get a palindrome (859456141654958).
The spelling of 514145021113543 in words is "five hundred fourteen trillion, one hundred forty-five billion, twenty-one million, one hundred thirteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •